Abstract
Computer science is largely about computation. Many kinds of computing devices have been described, some abstract and some very concrete. Among them are:
-
Automata, including Turing machines, Moore machines, Mealy machines, pushdown automata, and cellular automata.
-
Computer programs written in a programming language.
-
Algorithms written in natural language and pseudocode.
-
von Neumann computers.
-
BNF grammars.
-
Process algebras such as CCS.
Computer scientists collectively suffer from what I call the Whorfian syndrome the confusion of language with reality. Since these devices are described in different languages, they must all be different. In fact, they are all naturally described as state machines.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Lamport, L. (2010). Computer Science and State Machines. In: Dams, D., Hannemann, U., Steffen, M. (eds) Concurrency, Compositionality, and Correctness. Lecture Notes in Computer Science, vol 5930. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11512-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-11512-7_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11511-0
Online ISBN: 978-3-642-11512-7
eBook Packages: Computer ScienceComputer Science (R0)