Turing machines

  • Jeffrey R. Sampson
Part of the Texts and Monographs in Computer Science book series (MCS)


In the last chapter we mentioned some sets of input sequences which could not be described by regular expressions and which therefore could not be recognized by any finite automaton. It turns out that there are more general and powerful kinds of machines which can easily recognize those events. It is thus natural to seek the limits of mechanical behavior. Can we define a type of abstract machine, no matter how impractical it might be to build, which can compute anything that we regard as computable? Are there precisely describable processes that cannot be implemented on any machine?


Turing Machine Finite Automaton Context Free Grammar State Transition Diagram Terminal Symbol 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Chomsky, Noam. “On certain properties of formal grammars.” Information and Control, 2, 1959, pp. 137–167.MathSciNetzbMATHCrossRefGoogle Scholar
  2. Hopcroft, John E. and Ullman, Jeffrey D. Formal Languages and their Relation to Automata. Addison-Wesley, 1969.zbMATHGoogle Scholar
  3. Trakhtenbrot, B. A. Algorithms and Automatic Computing Machines. Heath, 1963.Google Scholar
  4. Turing, A. M. “On computable numbers, with an application to the Entscheidungs problem.” Proceedings of the London Mathematical Society, Series 2, 42, 1936, pp. 230–265.Google Scholar
  5. Wang, Hao. “A variant to Turing’s theory of computing machines.” Journal of the Association for Computing Machinery, 4, 1957, pp. 63–92.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag New York Inc. 1976

Authors and Affiliations

  • Jeffrey R. Sampson
    • 1
  1. 1.Department of Computing ScienceThe University of AlbertaEdmontonCanada

Personalised recommendations