The crucial property of this object is the so-called "halting problem".
The crucial property of this object is the so-called "halting problem". It includes paper divided into squares, each of which is either blank or contains one of a finite number of symbols. The paper is infinitely extensible, and the tape head can move to, read, write, or erase any single square, with each possible action determined by its internal state and the condition of the scanned square at a given moment. Conceived to determine if there can exist any universal algorithmic method for determining whether a proposition is undecidable, FTP, what is this hypothetical machine devised by an English logician?
The crucial property of this object is the so-called "halting problem".
Turing machine