Also known as: Alan Turing, Turing

Alan Turing (1912–1954) was a British mathematician and logician whose abstract Turing machine defined what it means for a problem to be computable and framed the idea of a single machine that can run any program.¹

Life and work

In his 1936 paper “On Computable Numbers,” Turing described a simple abstract device — a tape, a read/write head, and a table of rules — and proved that one universal version of it could simulate any other. That universal machine is the theoretical ancestor of every programmable computer.¹ During the Second World War he led code-breaking work at Bletchley Park, helping build electromechanical machines that broke the German Enigma cipher. After the war he contributed to early stored-program computer designs and to the foundations of artificial intelligence, proposing the test that bears his name.¹

Why they matter

Turing’s universal machine is the reason a CPU can run word processors, web servers, and an SDR decoder without being rewired for each — software, not hardware, defines the task. His computability results sit alongside the practical von Neumann architecture that John von Neumann formalised a decade later, and together they underpin all general-purpose computer hardware.¹

Legacy

The Turing Award, computing’s highest honour, is named after him, and his model remains the standard reference for what computers can and cannot, in principle, do.

Sources

1. Alan Turing — Wikipedia, for biography, the Turing machine, and Bletchley Park. ↩ ↩² ↩³ ↩⁴

See also

• John von Neumann
• Von Neumann architecture
• Central processing unit (CPU)
• Computer hardware