Computability and the universal machine: Discovery
The story
How the idea was found and came to be accepted
In 1928 David Hilbert posed three questions about mathematics: is it complete, is it consistent, and is it decidable [1]. Turing conceived the universal machine as a way of answering the last [1], modelling it on a human carrying out a calculation [1]. Alonzo Church, who created the λ-calculus in the 1930s [4], working independently, had arrived at his own answer a few months earlier, in a paper of 1936 [1][4]. When Turing saw Church's paper he realised at once that they were tackling the same problem [2]. Turing's paper appeared in the Proceedings of the London Mathematical Society in issues dated 30 November and 23 December 1936 [1], and he showed by means of his universal machine that mathematics is undecidable [1]. In 1945 von Neumann's First Draft of a Report on the EDVAC introduced the basic elements of the stored-program concept to industry [5]. On 21 June 1948 the Manchester Baby ran a program from memory for the first time [6].
as of 2026-11-12
People
The people behind it, their years and what each contributed
| Name | Years | Contribution |
|---|---|---|
| Alan Turing | 1912 to 1954 | Described the universal machine and showed that mathematics is undecidable, in his 1936 paper [1][3] |
| Alonzo Church | 1903 to 1995 | Created the lambda calculus and published an independent answer to Hilbert's decision problem in 1936, a few months before Turing [1][4] |
| John von Neumann | 1903 to 1957 | Wrote the 1945 EDVAC report that introduced the stored-program concept to industry [5] |
as of 2026-11-12
Milestones
The key moments, year by year
| Year | Event |
|---|---|
| 1928 | Hilbert poses three questions about mathematics, the last being whether it is decidable [1] |
| 1936 | Church's paper An unsolvable problem of elementary number theory gives his independent answer to the decision problem, a few months before Turing's [1][4] |
| 1936 | Turing's paper On Computable Numbers describes the universal machine and shows that mathematics is undecidable [1] |
| 1945 | Von Neumann's First Draft of a Report on the EDVAC introduces the stored-program concept to industry [5] |
| 1948 | The Manchester Baby runs a program from memory, the first stored-program computer [6] |
as of 2026-11-12
Sources
- Alan Turing Publishes "On Computable Numbers," Describing What Came to be Called the "Turing Machine" historyofinformation.com (Jeremy Norman's History of Information)
- Modern Logic: Since Gödel: Turing and Computability Theory Encyclopedia of Philosophy (article by Herbert B. Enderton), on Encyclopedia.com
- Alan Mathison Turing MacTutor History of Mathematics, University of St Andrews
- Alonzo Church (1903 - 1995) - Biography - MacTutor History of Mathematics MacTutor History of Mathematics, University of St Andrews
- Computer Pioneers - John Louis Von Neumann IEEE Computer Society
- Celebrating 75 years of Baby Science and Industry Museum, Manchester (blog post by Catherine Tindsley), 2023