The Turing machine is a model introduced by Alan Turing which performs simple instructions for carrying out a computational task. Turing introduced that model to clarify what a mechanical process computes. We can be sure that what a Turing machine can compute is considered to be computed mechanically. The point of Turing’s argument is its converse: what can be computed mechanically can be computed by a Turing machine. Turing developed arguments to support this direction of thought.


Turing Machine Computation Tree Finite Automaton Input Tape Universal Turing Machine 
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.

Copyright information

© Springer-Verlag London Limited 2011

Authors and Affiliations

  1. 1.Faculty of Science and EngineeringIshinomaki Senshu UniversityIshinomakiJapan

Personalised recommendations