The Computing Revolution: From Turing to Stored-Program Computers

Graduate Depth 38 in the knowledge graph I know this Set as goal
Unlocks 2 downstream topics
history History Of Science

Core Idea

Alan Turing's 1936 paper on computable numbers defined a theoretical model of computation (the Turing machine) that established the limits of what could be computed. During WWII, Turing worked on code-breaking at Bletchley Park, and the challenge of breaking the Enigma cipher drove early developments in mechanical computation. After the war, von Neumann, Turing, and others developed the concept of the stored-program computer — a machine that could be reprogrammed by modifying its internal memory rather than its hardware. Early computers (ENIAC, EDVAC) were massive, power-hungry machines. Yet the stored-program architecture established the fundamental principle of modern computing: code and data are both information, stored and manipulated the same way. The history of computing illustrates how abstract mathematical theory (Turing's formalism), military necessity, and engineering ingenuity converged to create a transformative technology.

Explainer

The computing revolution traces two converging paths: one through abstract mathematical logic, the other through wartime engineering necessity.

Alan Turing's 1936 paper 'On Computable Numbers' was not about engineering at all. It was a contribution to the mathematical foundations controversy — specifically, an attempt to answer David Hilbert's question whether there exists a definite procedure for deciding the truth of any mathematical statement. Turing answered no, by defining a mathematical abstraction — the Turing machine — and proving that some problems could not be solved by any such machine. The Turing machine was a thought experiment: an infinitely long tape, a read/write head, and a finite set of states. Its importance was theoretical: it defined, for the first time, what computation was. Any computation that can be performed at all can be described as a Turing machine computation.

The engineering path converged with the mathematical one during WWII. German forces used Enigma cipher machines whose settings were reset daily; German high command used a more complex system called Lorenz. At Bletchley Park, Turing helped design the 'Bombe,' an electromechanical machine that systematically tested Enigma configurations. Tommy Flowers and colleagues built Colossus (1943-1944), an electronic programmable machine that attacked Lorenz cipher traffic. Colossus used vacuum tubes — much faster than electromechanical components — and was arguably the first electronic programmable computer. Its existence was kept secret under the Official Secrets Act until the 1970s.

In the United States, ENIAC (Electronic Numerical Integrator and Computer), completed in 1945 by Mauchly and Eckert at the University of Pennsylvania, was 18,000 vacuum tubes and 30 tons. But its programs were set by rewiring. The crucial conceptual step came in John von Neumann's 1945 report on EDVAC: the stored-program architecture, in which instructions and data both lived in the same memory, allowing the machine to be reprogrammed without hardware changes. This was the fundamental insight of modern computing — programs are data, and a computer that can process data can process and execute programs. The Manchester Mark 1 (1949) was among the first operational stored-program computers.

The history illustrates how abstract theory, military urgency, and engineering ingenuity converged. No single person invented the computer; the invention was distributed, contested, and shaped by war. Turing himself received no public recognition during his lifetime — prosecuted for homosexuality in 1952, subjected to chemical castration, dead by 1954. The computing revolution's origins are inseparable from both intellectual brilliance and historical injustice.

What did you take from this?

Topics in reflective domains aren't scored by quiz answers. Read, reflect, and mark when you've thought it through.

Quiz me anyway →

Prerequisite Chain

Longest path: 39 steps · 114 total prerequisite topics

Prerequisites (1)

Leads To (2)