Stored-program computer: Science
Principles
The science it rests on, with why each principle matters to it
Relies on- Computability and the universal machine Turing's universal machine of 1936 showed that one machine, given another's description as data, can do that machine's work [6].
- Boolean logic The control and arithmetic units are built from logic circuits that follow Boolean algebra.
as of 2026-11-10
Discoveries
The discoveries that made it possible: when, by whom and what was found
| Year | Who | What |
|---|---|---|
| 1936 | Alan Turing | The universal Turing machine, a theoretical machine that reads its instructions from the same store as its data [6] |
| 1945 | John von Neumann, drawing on J. Presper Eckert and John Mauchly | The EDVAC report of June 1945, the first written design for an electronic stored-program computer [1][5] |
as of 2026-11-10
The science explained
The science behind it explained for a curious reader
Picture a cook and a recipe book. In the first electronic computers the recipe was built into the kitchen: to cook a different dish, workers had to move the pipes and taps, which took days. A stored-program computer writes the recipe on pages kept in the same cupboard as the ingredients. The cook reads one line, does it, and turns to the next; a line that says go back to step three makes a loop. Changing the dish means swapping the pages. The deeper point comes from Turing [6]: because the recipe is written in the same symbols as the ingredients, a recipe can describe another recipe, so one machine can imitate any other. That is why a single computer can be a typewriter, a game or a telephone. The catch is that the cook fetches recipe lines and ingredients through the same narrow door, which slows everything down [5].
as of 2026-11-10
Sources
- Milestones: Manchester University "Baby" Computer and its Derivatives, 1948-1951 Engineering and Technology History Wiki (IEEE)
- Von Neumann architecture Wikipedia
- Universal Turing machine Wikipedia