1936 (computable-numbers paper) / Europe
Turing models the limits of computation
Turing used an abstract symbol-reading machine to investigate computation and describe a universal machine. This was a mathematical model, not a completed electronic computer.
The story
Turing formalized rule-governed computation and showed that some decision tasks have no general mechanical solution. Church reached a related negative result through a different approach in the same year. The achievement concerns mathematical computability, not Turing alone building the first electronic computer. Physical computing developed through multiple contributions to logic, electronics and storage.
Connections and context
A universal machine could process descriptions of other machines, linking mathematical logic with later computing. Theoretical limits also show why greater speed cannot make every problem solvable.
Dates and precision
1936 (computable-numbers paper) Documented date
Positioned by the documented year, month or day. Missing precision is not inferred.
Representative map location
Cambridge
The marker represents a principal academic setting; completion and later work also involved Princeton and other sites.
Representative coordinates · 52.205°, 0.117°
A marker identifies one representative place, such as a manuscript collection, laboratory or observing site. It does not mean the work happened only there, or assign a shared discovery to one country.
Bibliography
- Turing’s 1936 paper and King’s College Cambridge archives
- Alan Mathison Turing, King’s College Cambridge
- About Alan Turing, King’s College Digital Archive
References are listed as plain bibliography titles. They support particular facts or context; a reference does not certify every interpretation in a story.