Room 1 · The Dreamers · 1936

The Universal Machine

The Universal Machine (Alan Turing, 1936): A single machine that can run any program.

In his paper on computable numbers, Turing imagined a machine with an infinite tape that reads and writes symbols following rules. He proved that a universal machine can imitate any other, the idea behind today's computers.

In 1936 Alan Turing, then 24 and a fellow at King's College, Cambridge, published "On Computable Numbers, with an Application to the Entscheidungsproblem." The paper set out to answer a question posed by the mathematician David Hilbert: is there a mechanical procedure that can decide whether any mathematical statement is provable?

To answer it, Turing first had to define what "mechanical procedure" means. He imagined a person, or a machine, working with a long tape divided into squares. At each moment it reads one symbol, looks at its current state, and follows a rule: write a symbol, move left or right, change state. That is all. Today we call this a Turing machine.

Then came the key step. Turing showed that one single machine can read the description of any other machine from its tape and imitate it exactly. He called it the universal machine. In other words, you do not need a different device for each task: you need one general device and different programs. That is the logical idea behind every computer since.

He also used the model to prove that Hilbert's question has a negative answer: some problems can never be decided by any procedure, however clever. Alonzo Church reached the same conclusion by a different route at almost the same time.

Turing worked on code-breaking during the Second World War and later on early computers in Manchester. He returns twice in this museum: with the Imitation Game in Room 2 and as the namesake of the award in Room 6.

Ask your AI: why can't any program decide, for every possible program, whether it will ever stop? Ask for the simplest explanation it can give.

Did you know? He wrote it to answer a problem in mathematical logic, Hilbert's decision problem, and ended up founding theoretical computer science.

Source: doi.org/10.1112/plms/s2-42.1.230

See it in the museum →

← The Laws of Thought · The First Artificial Neuron →

All of Room 1: The Dreamers

Cite this: Nazareno, I. (2026). The Universal Machine (1936). New Mind Museum. Retrieved November 17, 2026, from https://newmindmuseum.com/museum/the-universal-machine-1936/