Turing Machines (Stanford Encyclopedia of Philosophy)
A Turing machine then, or a computing machine as Turing called it, in Turing's original definition is a machine capable of a finite set of configurations (q_{1},ldots,q_{n}) (the states of the machine, called m-configurations by Turing). It is supplied with a one-way infinite and one-dimensional tape divided into squares each capable of ...