Mon premier blog

Languages and Machines: An Introduction to the Theory of Computer Science by Thomas A. Sudkamp

Languages and Machines: An Introduction to the Theory of Computer Science Thomas A. Sudkamp ebook
ISBN: 0201821362, 9780201821369
Page: 574
Format: djvu
Publisher: Addison Wesley

In 1936, Turing introduced an abstract device capable of performing all kinds of symbolic computations, a precursor of modern computers that would become known as the Turing machine. That's where we (the nerdy guys from engineering department) come in with formal languages — a substantial part of computer science. (This stuff is usually taught in introductory classes of theoretical computer science as a part of either automata theory or formal languages.). Hopcroft, Rajeev Motwani and Jeffrey D. For a formal, mathematical approach I recommend Introduction to Automata Theory, Languages and Computation by John E. Theoretical computer science or theoretical information technology (as referred by some people) is a formal foundation for the things we like to call computers. Logic was the first, and for many years, the main mathematical discipline used in the development of computers, and to this day large parts of computer science can be regarded as “applied logic.” If we compare logic and set theory to the “machine language” of computers, we can regard category theory as an extremely useful universal programming tool. Vladimiro Sassone, On the category of Petri net computations, 6th International Conference on Theory and Practice of Software Development, Proceedings of TAPSOFT '95, Lecture Notes in Computer Science 915, Springer, Berlin, .. In The Diamond Age, Stephenson does a very good job . What the hell is all that about? The computer program that searches for this pattern can be modelled as a finite state machine. By formalizing common languages we make the machines understand our instructions. Even if you did not follow the Samuel Eilenberg (left) and Saunders Mac Lane who introduced category theory.