How do we formally define computability and build the theoretical foundation for all computers?
Alan Turing (1912-1954) was a British mathematician and computer scientist who created the Turing machine model, proved the halting problem undecidable, and contributed to codebreaking during WWII.
Key contributions:
- 1936: Published “On Computable Numbers” introducing the Turing machine
- 1937: Proved the halting problem is undecidable
- 1939-1945: Led Hut 8 at Bletchley Park, breaking the Enigma code
- 1950: Created the Turing test for machine intelligence
The Turing machine became the standard model for computability theory.
- Founded computability theory
- Created the Turing machine model
- Proved fundamental undecidability results
- Pioneer of artificial intelligence
- Short life ended tragically in 1954
- Built from: Turing Machine
- Builds into: Computability Theory, Halting Problem, Artificial Intelligence
- Related: Alonzo Church, Church-Turing Thesis
Turing’s work defined what computation means. His machine model is the foundation of computer science, and his ideas about machine intelligence continue to shape AI today.