Concurrency, Compositionality, and Correctness pp 60-65

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5930)

Computer Science and State Machines

  • Leslie Lamport

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Leslie Lamport
    • 1
  1. 1.Microsoft ResearchUSA

Personalised recommendations