Quantum redactiones paginae "Machina Turing" differant

A '''Turing machine''' is a theoretical device that manipulates symbols contained on a strip of tape. Despite its simplicity, a Turing machine can be adapted to simulate the logic of any [[computer]] algorithm, and is particularly useful in explaining the functions of a [[CPU]] inside of a computer. The "Turing" machine was described by [[Alan Turing]] in 1937,<ref>The idea came to him in mid-1935 (perhaps, see more in the History section) after a question posed by [[M. H. A. Newman]] in his lectures -- "Was there a definite method, or as Newman put it, a ''mechanical process'' which could be applied to a mathematical statement, and which would come up with the answer as to whether it was provable" (Hodges 1983:93). Turing submitted his paper on 31 May 1936 to the London Mathematical Society for its ''Proceedings'' (cf Hodges 1983:112), but it was ''published'' in early 1937 -- offprints available February 1937 (cf Hodges 1983:129).</ref> who called it an "''a''(utomatic)-machine". Turing machines are not intended as a practical computing technology, but rather as a [[thought experiment]] representing a computing machine. They help computer scientists understand the limits of mechanical computation.▼