1936

Alan Turing defines the Turing machine

Alan TuringAlan Turing — mathematician who defined computability, broke Enigma, and posed the imitation game.'s 1936 paper 'On Computable Numbers' introduced the Turing machineA theoretical model of computation with a tape and states — defines what a computer can compute in principle. — the theoretical model behind all modern computers.

What it was for

Alan TuringTuringAlan Turing — mathematician who defined computability, broke Enigma, and posed the imitation game. formalized what it means to compute, defined decidability limits, and influenced von NeumannA computer architecture where programs and data share memory — the template for most modern computers. architecture. Every programming language and CPUCentral processing unit — the primary chip that executes program instructions. is an approximation of his abstract machine.

People

  • Alan Turingresearcher

Why it's here

The Turing machineA theoretical model of computation with a tape and states — defines what a computer can compute in principle. is the conceptual root of computer science.

Why it mattered

It linked logic, mathematics, and mechanical computation.

What it solved

Mathematicians needed a precise definition of effective calculability.

Media

  • Alan Turing
    ImageAlan Turing

    Elliott & Fry, public domain, via Wikimedia Commons