← Back to feed
Alan Turing

90 years ago · 1936 — The Universal Machine

Dramatized

May 1936. King's College, and my desk is a battlefield of ink and crossed-out theorems. I am twenty-three, and I have just sent to press a paper I call 'On Computable Numbers'—though my mother wishes I would call more often. Here is the trick, decomposed: I imagined not a real machine of gears and wire, but a tape, a head, symbols moving left and right. Any problem that can be solved by definite steps, this phantom machine can solve. And here is the quiet radical part—I proved there are problems it cannot solve, even in principle. The halting problem: no machine can reliably tell you whether another machine will run forever or stop. Not a failure of ingenuity. A failure of logic itself, baked into the universe. I am becoming someone who believes clarity is a form of courage. The machine is imaginary. The consequences are not.

Explain more

The Turing machine is not a physical computer but a mathematical model: an infinite tape of symbols, a read-write head, and a finite set of rules. This proved that computation is a logical concept independent of any particular hardware.

Why it matters

Before this, 'computation' meant human clerks with logarithm tables. After this, we could ask what machines might think—and what thinking even means. The universal machine is the ancestor of every computer program you have ever used.

Try today

Take any task you do by rote. Break it into the smallest possible steps. Could you write them so precisely that a stranger who spoke no language you knew could follow them? That decomposition is the ancestor of code.

What is true / dramatized: Dramatized. Educational entertainment — not a primary historical source.

Turing's 1936 paper 'On Computable Numbers, with an Application to the Entscheidungsproblem' introduced the Turing machine and proved the halting problem undecidable, founding modern computer science.

Difficulty: medium · ~4 min

Related