Skip to content
Great Minds

Alan Turing

The Man the State Machine Never Forgave

We can only see a short distance ahead, but we can see plenty there that needs to be done.
Alan Turing
Life
1912–1954
Era
The Birth of Computer Science
Many Roles
Mathematician, Codebreaker, Computer Scientist

Tap or hover a cell to see what Turing meant by it.

By 1940, the German navy was routing its U-boat convoys using a cipher machine called Enigma, and the messages it produced looked, to anyone without the key, like uniform noise. Bletchley Park's codebreakers had a shortcut, of sorts: they often knew, or could guess, a fragment of what a message was likely to say — a weather report always opened the same way, a routine message often ended with the same closing phrase. That fragment was called a "crib." Alan Turing's insight was to build a machine, the Bombe, that didn't try to guess the day's settings directly. It ran through the millions of possible rotor configurations and threw out every one that produced a logical contradiction with the crib, fast enough that only a handful of candidates were left to check by hand.

It worked. But the machine that broke Enigma was really a side project of a stranger idea Turing had already published four years earlier, in 1936 — before any electronic computer existed to run it. In a paper on an obscure problem in mathematical logic, he'd described a hypothetical machine: an infinite tape divided into cells, a head that could read a symbol, write a symbol, and move one cell left or right, and a table of rules governing what to do next. He used this imaginary device to prove that a specific, well-defined question — will this machine ever stop running? — could never be answered in general, by any machine, no matter how sophisticated. Along the way, without quite intending to, he had also described what a computer actually was, in the abstract, a decade before anyone built one.

Fourteen years later, he asked a stranger version of the same question. Not "can a machine compute," but "can a machine think" — and rather than argue about it philosophically, he proposed a test: put a human and a machine behind a curtain, let an interrogator question both, and see if the interrogator could tell which was which. He never claimed the test proved anything about a machine's inner life. He just thought it was the only version of the question anyone could actually answer.

That instinct — trade an unanswerable question for one you can actually test — runs through everything on this page, right up to the ending the country he helped save gave him anyway.

Core Philosophy

Turing's defining move, twice, was to take a question that sounded unanswerable and replace it with one that could actually be tested. In 1936, instead of debating the philosophy of mathematical truth, he built an imaginary machine simple enough to reason about precisely — and used it to prove that some questions about computation have no general answer at all. In 1950, instead of debating what "thinking" really means, he proposed a test anyone could run: could an interrogator tell a machine from a person in conversation? He never claimed either paper settled the deeper question. He just refused to accept that an unanswerable question was a reason to stop working.

He never claimed to know whether a machine could truly think. He just insisted that if we couldn't even define the question precisely, we had no business claiming the answer was obviously no.

How They Thought

Thinking Process

  1. 01

    Reduce the act of computing to its smallest physical steps

    Read a symbol, write a symbol, move one cell left or right, change state. Turing showed any calculation a human "computer" could carry out by following fixed rules could be reduced to exactly these motions.

  2. 02

    Prove a negative with an explicit machine

    Rather than argue abstractly that a class of mathematical questions was unanswerable, he built a precise hypothetical machine and showed one specific, well-defined question — will this machine ever halt? — that no such machine could always answer.

  3. 03

    Turn interception into elimination

    At Bletchley Park, the Bombe didn't guess Enigma's daily settings directly — it worked backward from a guessed fragment of plaintext to eliminate every setting that produced a logical contradiction, leaving only a handful to check by hand.

  4. 04

    Sidestep an unanswerable question with a testable one

    Rather than debate what "thinking" really means, his 1950 paper replaced the question with an experiment anyone could actually run: the Imitation Game.

  5. 05

    Publish the theory before the machine exists to run it

    The 1936 paper describing a universal computing machine predates any general-purpose electronic computer by close to a decade.

Transferable Frameworks

Mental Models

Any Procedure Can Be Mechanized

If a task can be described as a fixed sequence of simple steps, a sufficiently simple machine can, in principle, do it.

Some Questions Have No Answer, Provably

The halting problem wasn't left unsolved for lack of trying — Turing proved no general method could ever solve it.

Define Intelligence by What It Does

The Turing Test sidesteps philosophy by asking a question you can actually run as an experiment: can you tell the difference?

Elimination Beats Brute Force

The Bombe didn't guess the right Enigma setting — it eliminated the impossible ones fast enough that only a few remained to check.

Theory Can Precede the Machine

He described a universal computer on paper nearly a decade before anyone built a general-purpose one.

The Undecidable Question

From "Can It Compute" to "Can It Think"

1936

Defining What a Machine Could Compute

"On Computable Numbers" answered a narrow, technical question: could a mechanical procedure decide, in general, whether a mathematical statement was provable? Turing proved it could not.

1950

Asking What a Machine Could Be

"Computing Machinery and Intelligence" reframed the question entirely — not what a machine could calculate, but whether it could behave indistinguishably from something that thinks, and whether that distinction even mattered.

The same instinct ran through both papers: when a question seems unanswerable, replace it with a question you can actually test.

The Output

Big Ideas

On Computable Numbers (1936)

Introduces the Turing machine and proves Hilbert's Entscheidungsproblem has no general solution — the founding document of theoretical computer science.

The Universal Machine

A single machine capable of simulating any other Turing machine, given the right instructions — the theoretical blueprint for every general-purpose computer since.

The Bombe (1940)

An electromechanical codebreaking device, built with Gordon Welchman, that rapidly eliminated impossible Enigma rotor settings — central to breaking German naval Enigma traffic.

Computing Machinery and Intelligence (1950)

Proposes the Imitation Game, now known as the Turing Test — an operational definition for machine intelligence that sidesteps an unanswerable philosophical question.

ACE and the Manchester Computers

His postwar design work at the National Physical Laboratory and the University of Manchester helped turn the theoretical universal machine into working hardware.

The Life, Briefly

Timeline

  1. 1912

    Born in London.

  2. 1926–1931

    Attends Sherborne School; forms a close bond with fellow student Christopher Morcom, whose death in 1930 deeply affects him.

  3. 1931

    Enters King's College, Cambridge.

  4. 1936

    Publishes "On Computable Numbers," introducing the Turing machine.

  5. 1936–1938

    Completes a PhD at Princeton under Alonzo Church.

  6. 1939

    Joins the Government Code and Cypher School at Bletchley Park at the outbreak of WWII.

  7. 1940

    Designs the Bombe, with Gordon Welchman, to break Enigma-encrypted German military communications.

  8. 1945

    Awarded an OBE for wartime codebreaking work, kept secret for decades under the Official Secrets Act.

  9. 1945–1947

    Designs the ACE (Automatic Computing Engine) at the National Physical Laboratory.

  10. 1948

    Joins the University of Manchester, working on its early computers.

  11. 1950

    Publishes "Computing Machinery and Intelligence," proposing the Turing Test.

  12. 1952

    Prosecuted for "gross indecency"; accepts chemical castration rather than prison, and loses his security clearance.

  13. 1954

    Dies in Wilmslow, England, ruled a suicide by cyanide poisoning, at age 41.

  14. 2009

    The UK government issues a formal public apology for his treatment.

  15. 2013

    Granted a posthumous royal pardon by Queen Elizabeth II.

Why It Still Matters

Enduring Influence

The Universal Machine

Ancient

A single theoretical machine, given the right instructions, could simulate any other computing procedure.

Modern

The direct theoretical ancestor of every general-purpose computer and smartphone — one piece of hardware, running any software loaded onto it.

Why It Matters

Every app on every phone today runs on the same universal-machine principle Turing described on paper in 1936.

The Turing Test

Ancient

Proposed replacing "can machines think" with an operational test: could a human interrogator tell a machine from a person in conversation?

Modern

The direct reference point for nearly every debate about whether today's large language models are "really" intelligent.

Why It Matters

Modern AI chatbots are still routinely described, praised, or dismissed in terms of whether they "pass" the exact test he proposed in 1950.

Elimination-Based Search

Ancient

The Bombe found the right Enigma setting by rapidly eliminating the impossible ones, not by checking every option directly.

Modern

The same logic behind constraint-satisfaction algorithms used across modern cryptography, scheduling, and search.

Why It Matters

Most large-scale search problems today are still solved by elimination, not brute force — his wartime machine was an early, physical version of it.

Provable Limits on Computation

Ancient

Proved the halting problem has no general algorithmic solution — some questions about computer programs can never be answered by another program.

Modern

The theoretical foundation of computer science's field of computability and complexity theory, still taught as one of the first proofs most computer science students encounter.

Why It Matters

Every claim that AI could eventually solve any problem runs directly into a limit Turing proved in 1936.

Go Deeper

Books & Resources

Alan Turing: The Enigma Andrew Hodges

The definitive biography, and the basis for the 2014 film The Imitation Game — meticulous on both the mathematics and the persecution.

The Essential Turing ed. B. Jack Copeland

A collected edition of Turing's own key papers, including "On Computable Numbers" and "Computing Machinery and Intelligence," with historical commentary.

Turing's Cathedral George Dyson

Traces the path from Turing's theoretical machine to the first working general-purpose computers built at Princeton's Institute for Advanced Study.

Scholarship Notes
  • "Sometimes it is the people no one imagines anything of who do the things that no one can imagine" circulates widely online as a Turing quote. It does not appear in any of his writing — it originates in the 2014 film The Imitation Game, not the historical record.
  • The claim that his codebreaking work "shortened the war by two years and saved 14 million lives" is a widely repeated estimate, not a precisely documented figure. Historians broadly agree Bletchley Park's work was decisive; the specific numbers vary by source and method of estimation.
  • The 1954 inquest ruled Turing's death a suicide, and this remains the standard historical conclusion, though some historians have noted the evidence was largely circumstantial and have floated the possibility of accidental cyanide exposure from his home chemistry experiments.

He spent his career asking questions that sounded almost too simple to be profound: what does it mean to compute something? What would it even mean for a machine to think? The answers he found — that some questions have no general solution, that intelligence might be defined by behavior rather than essence — are still the ground almost all of computing stands on. The law that convicted him in 1952 wasn't repealed in England and Wales until 1967, thirteen years after his death.