Turing machines
- computation
- european
Alan Turing’s 1936 paper defined a mathematical model of computation using a finite control, symbols and an unbounded tape. A universal machine could simulate another machine from its description, making programs themselves objects that computation could manipulate. Turing also proved fundamental undecidability results, showing that no general algorithm can answer certain questions about all computations. The work established limits and a conceptual foundation, rather than reporting the construction of a physical computer. It belongs to a broader convergence with Church’s independently developed formal analysis of effective calculability. **Timeline anchor:** 1 January 1936 CE. **References:** [Source 1](https://en.wikipedia.org/wiki/Turing_machine), [Source 2](https://en.wikipedia.org/wiki/Halting_problem).
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's "On Computable Numbers" on The history of computer science by @athan