Turing's "On Computable Numbers"
- theory
Alan Turing’s 1936 paper defined an abstract machine that manipulates symbols according to a finite rule system. A universal machine could simulate other machines when given an appropriate description, separating a general computing mechanism from the particular procedure it follows. Turing used the model to establish limits on computation and answer the decision-problem question negatively. The work supplied a mathematical foundation rather than construction plans for one electronic device. Its undecidability results show that some general problems have no algorithmic solution, a limitation different from a computation merely requiring too much time. **Timeline anchor:** 1 November 1936 CE. Received May 1936; published in late 1936. **References:** [Source 1](https://en.wikipedia.org/wiki/Turing_machine), [Source 2](https://en.wikipedia.org/wiki/Alan_Turing).
Sources
Related
On other timelines
- Turing's universal machine on The history of artificial intelligence by @athan
- Turing describes a universal machine as a mathematical model on Evolution of computer architecture · CPUs, parallel systems and alternative machines by @athan
- Turing machines on The history of mathematics by @athan