SPATIAL-COGNITIVE ATLAS · VOYAGE EIGHT

When Symbols Became Machines — From Written Procedures to Stored Programs

A computer is not a box invented by one person on one day. Written procedures read by people, hand-carried digits, state categories punched into cards, logical expressions, opening and closing relays, and instructions in memory acquired new material forms in different cities and institutions.

QUESTION FOR THE ROUTE

Through which layers did a procedure understood and followed by people become a program executed by a machine and still open to human verification?

WHAT THE LINE DOES NOT CLAIM

The line is neither evidence that one Baghdad manuscript travelled unchanged into Manchester circuitry nor a ranking of civilizations or nations. It is the viewer's edited itinerary for comparing translation with independent discovery, unbuilt designs with working machines, mathematical models with engineering implementations, and individual writing with team labour; every pin states its own location basis and limit.

The camera rests on each city while you read, then eases through the runway between scenes. Select any marker or scene link to travel in either direction.

The same route, four questions

A lens never hides a scene or proves a cause. It changes which places you compare first, and the URL preserves your choice.

Whole route Translation networks Commercial demand Observation and institutions Patronage and power

Commercial demand · READING QUESTION

Which recurring problems and audiences made this mathematics useful and worth transmitting?

Recurring work in taxation, table production, census tabulation, ballistics, and computer demonstrations demanded faster and less error-prone procedures. Not every scene arose from commerce, however; the decision problem and incompleteness cannot be explained by market demand alone.

Start with:Rouen London Washington DC Berlin Philadelphia Amsterdam

Demand can shape selection and circulation; it does not prove an invention site, a single cause, or civilizational superiority.

Live map · 지도를 불러오는 중…

07 / 16 · 1890 CE

Washington DC

01 · c. 825 CE
Baghdad · Composition
Al-Khwarizmi — Writing Calculation as a Procedure
Al-Khwarizmi organized arithmetic with Indian numerals so an Arabic reader could follow the operations in order. The original is lost and its exact date unknown, but his name survived in Latin as Algoritmi and became the source of “algorithm.”
PAUSE AND ASK
Can a skilled calculator's practice be written as an order another reader can reproduce without that person present?
How the idea changed
By arranging operations with Indian place-value numerals into ordered prose, arithmetic became not only an answer but a repeatable procedure. This was not a modern programming language or the later abstract definition of an algorithm, but it made rules followed by a person into a transferable unit of knowledge.
What this place made possible
The Abbasid court, administrative calculation, and cultures of translation and copying in ninth-century Baghdad created conditions for comparing numeral systems and astronomical and arithmetical texts. The work is not assigned wholesale to a single building called the House of Wisdom.
How it moved
Indian place-value numerals and calculation traditions → Arabic arithmetic and manuscript copying → multiple Latin adaptations reflecting a lost original → the author name *al-Khwarizmi* changing into *Algoritmi* and eventually algorithm as a word for procedure
Do not overclaim
The original Arabic arithmetic is lost and its exact date is unknown, so c. 825 is an editorial anchor. This does not mean al-Khwarizmi single-handedly invented every algorithm or decimal numeral, or that he wrote modern code.
Evidence sources
- MacTutor — Al-Khwarizmi
  Supports: Al-Khwarizmi's Baghdad context, arithmetic with Hindu numerals, the lost original, and the Latin Algoritmi lineage
Stable link to this scene
BaghdadToledo
02 · c. 1150 CE
Toledo · Translation
Latin Algoritmi — A Name Becomes a Method
Across twelfth-century Iberian translation networks, al-Khwarizmi’s arithmetic met new readers through several Latin versions and adaptations. The c. 1150 date is an editorial anchor, not a claim that one Toledo institution, translator, or moment delivered numerals and procedures to all Europe.
PAUSE AND ASK
How did a person's name become, in another language, a name for a learnable method of calculation?
How the idea changed
Latin readers translated, adapted, and annotated unfamiliar numerals and operations, reading *Algoritmi* both as an author's name and a manner of calculation. As procedures became teaching texts in a new language, a proper name gradually moved toward a general word for method.
What this place made possible
The multilingual environment of twelfth-century Toledo and Iberia brought Arabic scientific texts, Latin readers, and the language skills of Jewish, Christian, and Muslim scholars into multiple translation relationships. It was not one centrally organized modern translation school.
How it moved
Arabic arithmetic traditions and manuscripts → oral mediation, Latin translation, and adaptation in Iberia → monastic and school texts in the algorism tradition → long-term lexical change from an author's name to a general procedure
Do not overclaim
The c. 1150 date is an anchor for several textual traditions. It does not claim that one Toledo translator rendered one complete manuscript and delivered numerals and algorithms to all of Europe at once.
Evidence sources
- Science in Context — The Arabic–Latin Translation Program in Toledo
  Supports: Multiple actors, patrons, and language mediation in twelfth-century Toledo, and the limits of a single-school model
Stable link to this scene
ToledoRouen
03 · 1642 CE
Rouen · Main activity
The Pascaline — Delegating Carrying to Gears
Commercial demand · lens spotlight
At nineteen, Pascal built a machine in Normandy whose gears performed addition, subtraction, and automatic carrying to help with his father’s tax work. Surviving machines show that part of manual arithmetic could become physical motion; they were not mass-produced general-purpose computers.
PAUSE AND ASK
What changes when carrying between digits moves from a person's memory into the motion of gears?
How the idea changed
A wheel completing one revolution advanced the next position, turning carrying into a physical state transition. With part of the rule fixed in the mechanism, a user handled input and output instead of remembering every intermediate carry.
What this place made possible
The repeated accounts handled by Pascal's tax-collecting father in Rouen supplied a concrete problem for mechanizing reliable addition and subtraction, while precision metalwork and patent patronage enabled multiple prototypes.
How it moved
Repeated Norman tax accounts → Pascal's prototypes and carrying mechanism → royal privilege and demonstrations → a small number of surviving machines, museum conservation, and study of mechanical calculation
Do not overclaim
1642 anchors the early construction, not necessarily the date of every surviving machine. The Pascaline automated parts of addition and subtraction but was neither a mass-produced programmable computer nor asserted to be the absolute first calculating machine of every kind.
Evidence sources
- Musée des Arts et Métiers — Machine arithmétique de Pascal
  Supports: The Pascal calculator's construction context, mechanism, and surviving collection record
Stable link to this scene
RouenLondon
04 · 1834 CE
London · Main activity
Babbage — Designing a Machine for More Than One Table
Commercial demand · lens spotlight
After the Difference Engine project stalled, Babbage began conceiving an Analytical Engine around 1834, with punched-card instructions, a store for numbers, a mill for operations, and repetition and branching. The question shifted from one table-making machine to a design accepting many procedures, but the complete engine was never built in his lifetime.
PAUSE AND ASK
Could a machine accept different procedures on cards instead of being built to produce only one kind of table?
How the idea changed
Babbage distinguished a *store* for numbers, a *mill* for operations, punched-card instructions, repetition, and conditional branching, separating machine architecture from the procedure performed. Different instruction arrangements, rather than permanently fixed gearing, could express different calculations.
What this place made possible
London's Royal Society, government funding, precision engineers, and demand for printed tables made a large calculating-engine project possible, while cost and conflict among Babbage, government, and makers blocked completion. The same city exposes conditions of both design and failure.
How it moved
Error-prone printed tables and the Difference Engine plan → government patronage and Joseph Clement's precision work → Jacquard-card ideas and the Analytical Engine design → drawings, notes, and unfinished parts → later museum construction and historical reassessment
Do not overclaim
1834 marks the emerging Analytical Engine concept, not one completed design date. Because the full machine was neither built nor run in Babbage's lifetime, architectural resemblance to a modern computer is kept distinct from demonstrated operation.
Evidence sources
- Science Museum — Charles Babbage's Difference Engines
  Supports: Museum evidence for Babbage's government-backed engine project and the distinction between unfinished originals and later construction
- Computer History Museum — Babbage Engines
  Supports: The Difference and Analytical Engines, including store, mill, cards, branching, and the unbuilt boundary
Stable link to this scene
LondonLondon
05 · 1843 CE
London · Publication
Ada Lovelace — Seeing Machine and Program as Distinct
Lovelace translated Menabrea’s account of the Analytical Engine and added notes more than three times as long. Note G’s Bernoulli-number table is often read as the first published computer program, though collaboration with Babbage and definitions of “program” remain debated. Her clearer leap was to distinguish rules that might manipulate symbols, letters, or music as well as numbers.
PAUSE AND ASK
Can what an unfinished machine should do be described as a table of instructions distinct from its parts?
How the idea changed
Lovelace's Note G arranged operations and intermediate variables for Bernoulli numbers in a table, inviting readers to distinguish the machine from its procedure. More broadly, she argued that relations expressed symbolically might let rules operate on letters or music as well as numbers.
What this place made possible
London scientific networks, sustained collaboration with Babbage, translation of a French paper, and publication in Taylor's *Scientific Memoirs* turned an unbuilt machine into a publicly discussable text. Class privilege enabled education while formal scientific careers remained narrow for women.
How it moved
Babbage's drawings and explanations plus Menabrea's French account → Lovelace's translation, Notes A–G, and correspondence with Babbage → 1843 print publication → later debates in programming and gender history
Do not overclaim
Note G is widely read as the first published computer program, but definitions of program, Babbage's earlier tables, and the division of collaboration remain debated. Lovelace is neither made a lone inventor nor erased as a mere copyist.
Evidence sources
- Science Museum — Women in computing
  Supports: Lovelace's Analytical Engine notes, Bernoulli-number procedure, and the historical interpretation boundary
- Bodleian Libraries — Ada Lovelace archive
  Supports: The collaboration context preserved in Lovelace–Babbage correspondence and archival materials
Stable link to this scene
LondonCork
06 · 1854 CE
Cork · Composition
Boole — Calculating with Forms of Reasoning
As professor in Cork, George Boole treated combinations of propositions and classes through symbolic operations in The Laws of Thought. The book did not design an electronic computer; it made forms of inference objects of calculation. The bridge from logical expressions to open and closed circuits appeared eighty-three years later in Shannon’s work.
PAUSE AND ASK
Can forms of reasoning such as AND, OR, and NOT be combined and calculated like quantities?
How the idea changed
Boole treated combinations of propositions and classes through symbols and laws of operation, separating logical form from content. A logical expression was not yet a wire, but making inference algebraically manipulable and checkable created a language that could later meet circuit design.
What this place made possible
A professorship at the newly founded Queen's College Cork gave the largely self-taught Boole time to teach and research, while London and Cambridge scholarly publishing networks connected work written in Cork to wider audiences.
How it moved
British algebra and logic debates → a Cork professorship and teaching → publication of *The Laws of Thought* in 1854 → later reconstruction in mathematical logic → independent 1930s switching theories applying Boolean algebra to circuits
Do not overclaim
Boole did not design an electronic computer or modern binary logic gates. Eighty-three years of reinterpretation and independent engineering work separate the symbolic logic of 1854 from relay circuits in 1937.
Evidence sources
- University College Cork — Professor George Boole
  Supports: Boole's Cork professorship, life, and the institutional setting of his 1854 work
- George Boole 200 — The Laws of Thought
  Supports: The logic and probability agenda of *The Laws of Thought* and its Cork period
Stable link to this scene
CorkWashington DC
07 · 1890 CE
Washington DC · Main activity
Hollerith — Counting a Population with Punched Cards
Commercial demand · lens spotlight
The 1880 U.S. census had taken almost a decade to tabulate. In 1890 clerks transferred age, sex, race, citizenship, and other answers into holes, and Hollerith’s electrical readers, counters, and sorters processed the cards. People became machine-readable data, while the state still chose the categories and human punching and sorting labour remained essential.
PAUSE AND ASK
When tens of millions of lives become holes in cards, what can be counted faster—and what disappears outside the categories?
How the idea changed
Encoding responses as holes at predefined positions and reading them through electrical contacts turned human attributes into standardized records a machine could count and sort. An algorithm now involved data format, input labour, classification rules, and machine processing as well as arithmetic.
What this place made possible
Washington's federal census office concentrated a constitutionally recurring national count, a large budget, and pressure from the previous census backlog. State administration created a market for machines while wielding power to define categories such as race, sex, and citizenship.
How it moved
The 1880 tabulation backlog → Hollerith's punched-card ideas and Census Office trials → clerical punching and checking → electrical tabulators and sorters → government contracts, international statistics, and a later corporate data-processing industry
Do not overclaim
The machine did not automate the census as a whole. People visited, recorded, punched, and checked, while the state defined the categories. The 1890 speedup is not credited to Hollerith alone or to one device in isolation.
Evidence sources
- U.S. Census Bureau — The Hollerith Machine
  Supports: Development and testing at the Census Office and the punched-card, electrical reading, and tabulation process
- U.S. Census Bureau — About the 1890 Census
  Supports: The scale, question categories, human work, and mechanical tabulation context of the 1890 census
Stable link to this scene
Washington DCGöttingen
08 · 1928 CE
Göttingen · Teaching / position
Hilbert and Ackermann — Can Every Logical Problem Be Decided?
Principles of Mathematical Logic asked whether a finite procedure could determine whether any logical expression is universally valid. The Entscheidungsproblem posed an ambitious question before “mechanical method” had a precise definition. Göttingen marks the Hilbert school’s teaching and research context, not an exact writing room or publication city.
PAUSE AND ASK
Is there a finite rule-governed procedure that always decides whether any logical expression is universally valid?
How the idea changed
Hilbert and Ackermann turned a hope for mechanical solution into the explicit universal *Entscheidungsproblem*. Instead of first specifying a device, they asked whether a decision procedure could halt with yes or no on every input, setting a target later models of computation had to answer.
What this place made possible
Göttingen's mathematical institute, teaching, axiomatization program, and international student network made foundational questions in logic, geometry, and arithmetic a shared agenda. The pin marks the Hilbert school's research and teaching environment, not an exact writing room or publisher's address.
How it moved
Nineteenth-century axiomatization and formal logic → the Hilbert program and Göttingen teaching → the decision problem in Hilbert and Ackermann's 1928 text → Gödel's results on formal systems → Church's and Turing's distinct 1936 negative answers
Do not overclaim
The decision problem is not a vague question about making all mathematics easy for people; it asks precisely for a finite procedure deciding universal validity in first-order logic. The 1928 question, 1931 incompleteness, and 1936 uncomputability are connected but not the same theorem.
Evidence sources
- Stanford Encyclopedia of Philosophy — The Church–Turing Thesis: The Decision Problem
  Supports: The formal setting of the Entscheidungsproblem and the distinct negative solutions by Church and Turing
Stable link to this scene
GöttingenVienna
09 · 1931 CE
Vienna · Main activity
Gödel — Formalization Reveals Its Own Limits
Gödel showed that effectively axiomatized systems strong enough for natural-number arithmetic contain statements they cannot decide under specified consistency assumptions, and generally cannot prove their own consistency by their own means. This does not say that all mathematics is wrong or settle the power of every machine not yet defined.
PAUSE AND ASK
If one formal system is asked to prove every arithmetical truth, what remains once the system can encode statements about itself?
How the idea changed
Gödel encoded formulas and proofs as natural numbers, enabling arithmetic to speak about its own provability. Under specified consistency conditions, any sufficiently strong effectively axiomatized system has true statements unprovable within it and generally cannot prove its own consistency internally.
What this place made possible
The University of Vienna, its mathematical colloquium, and discussions of logic and language around the Vienna Circle gave Gödel a community in which to master and debate the Hilbert program's formal tools. Political violence and antisemitism soon fractured that scholarly network.
How it moved
Göttingen formalism and completeness questions → Vienna logic colloquia and Gödel numbering → 1930 announcement and 1931 paper → migration to Princeton's IAS and later interpretation → computability, proof theory, and computer verification research
Do not overclaim
The incompleteness theorems do not automatically say all mathematics is false or incomplete, that the human mind exceeds every machine, or that computers cannot think. Their assumptions about strength, effective axiomatization, and consistency remain explicit.
Evidence sources
- Stanford Encyclopedia of Philosophy — Gödel's Incompleteness Theorems
  Supports: The exact conditions of the two incompleteness theorems, Gödel numbering, and limits on common overstatements
- Institute for Advanced Study — Kurt Gödel: Life, Work, and Legacy
  Supports: The biographical context of Gödel's Vienna education and research and later move to Princeton
Stable link to this scene
ViennaPrinceton
10 · 1936 CE
Princeton · Composition
Church — Defining Computation Through Function Substitution
Alonzo Church used lambda calculus and recursive functions to formalize effective calculability and gave a negative answer to the general decision problem. At nearly the same time Turing reached the same boundary with a very different machine model. Equivalence among formal models is a theorem; the Church–Turing thesis about every intuitive effective procedure is a distinct claim.
PAUSE AND ASK
If effective calculation is defined through functions and substitution rules, can the existence of a procedure for every logical problem be settled?
How the idea changed
Church established a formal class of computable functions through lambda definability and recursive functions, then showed that no function in that class solves the general decision problem. Turning the intuitive phrase 'mechanical method' into a manipulable mathematical object made uncomputability itself provable.
What this place made possible
Princeton's logic seminars, the *Annals of Mathematics*, and a concentration of visitors and graduate students connected the formal work of Church, Kleene, and Rosser with Turing's later study there. The place enabled comparison among models rather than constituting one person's lone school.
How it moved
Gödel and Herbrand on recursive functions → Church and Kleene's lambda calculus → Church's 1936 undecidability paper → Turing's independent machine model and equivalence results → the Church–Turing thesis and computability curricula
Do not overclaim
That lambda calculus and Turing machines express the same computable functions is a formal result. The Church–Turing thesis identifying every intuitive effective procedure with that class is conceptual and evidential, not another theorem inside one formal system.
Evidence sources
- Stanford Encyclopedia of Philosophy — Alonzo Church
  Supports: Church's Princeton work, lambda definability, recursiveness, and the 1936 undecidability result
- Princeton University Archives — Alan Turing's Princeton file
  Supports: The institutional link of Turing's Princeton study and work under Church
Stable link to this scene
PrincetonCambridge
11 · 1936 CE
Cambridge · Composition
Turing — Modelling a Procedure as a Machine
Alongside Church’s lambda calculus, Turing modelled a person following symbol-manipulation rules as an abstract machine. The agreement of distinct models helped establish a mathematical account of effective procedure.
PAUSE AND ASK
By imagining a person who sees one square of paper and follows fixed rules, can the act of computation be defined through minimal operations?
How the idea changed
Turing abstracted rule-governed symbol work into an unbounded tape, a reading and writing head, finitely many states, and a transition table. In the same framework he described a universal machine that interprets encodings of other machines and a boundary on deciding in general whether machines halt.
What this place made possible
Mathematical training at King's College Cambridge, Max Newman's foundations lectures, and access to libraries and journals enabled Turing to derive a formal model from a calculator's physical actions. During review and publication he learned of Church's independent result, leading onward to Princeton.
How it moved
Hilbert's decision problem and Newman's lectures → analysis of a person calculating on paper → 1936 manuscript and 1937 print publication → comparison with Church's model → postwar stored programs, programming languages, and complexity theory
Do not overclaim
A Turing machine was not an electronic computer built in 1936 but an abstract model for computability. Turing completeness does not mean fast or intelligent, and the halting result does not prevent analysis of termination for particular restricted programs.
Evidence sources
- The Turing Digital Archive — On Computable Numbers
  Supports: Archival and original-paper context for the 1936 manuscript, computing machines, the universal machine, and the decision problem
- The Turing Digital Archive — About Alan Turing
  Supports: Turing's King's College Cambridge education and the biographical route onward to Princeton
Stable link to this scene
CambridgeCambridge, MA
12 · 1937 CE
Cambridge, MA · Composition
Shannon — Turning Logical Expressions into Relay Circuits
MIT graduate student Claude Shannon connected open and closed relays with Boolean true and false, allowing complex switching circuits to be analysed and simplified as logical expressions. His 1937 thesis is distinct from its 1938 publication, and Victor Shestakov and others produced independent related work. The achievement was a design bridge, not a literal identity of logic and electricity.
PAUSE AND ASK
Can a circuit of hundreds of relays be analysed and redesigned more simply through logical expressions instead of tracing every wire?
How the idea changed
Shannon mapped open and closed relay contacts to Boolean zero and one conditions, writing circuits as expressions and simplifying them by equivalence transformations. A two-way design translation between symbolic logic and physical switches turned circuits from trial-and-error wiring into calculable structures.
What this place made possible
MIT electrical engineering and maintenance work on Vannevar Bush's Differential Analyzer gave Shannon a concrete problem in complex relay circuits, while academic and industrial networks circulated the 1938 paper. Shestakov and others produced independent related work elsewhere in the same period.
How it moved
Symbolic logic after Boole → relay-circuit problems in MIT's Differential Analyzer → 1937 master's thesis and 1938 AIEE paper → switching and communication research at Bell Labs → digital logic synthesis and hardware design
Do not overclaim
This was not discovery of a natural identity between logic and electricity but a model of specified relay conditions in Boolean expressions. The 1937 thesis is distinguished from its 1938 publication, and independent prior or parallel work by Shestakov and others is not erased.
Evidence sources
- MIT News — Claude Shannon dies; was founder of digital communications
  Supports: Shannon's MIT thesis, the Boolean treatment of Differential Analyzer relays, and his later career
- Computer History Museum — Boolean Logic and Digital Circuits
  Supports: The history of analysing and simplifying switching circuits with Boolean algebra and its connection to digital logic
Stable link to this scene
Cambridge, MABerlin
13 · 1941 CE
Berlin · Main activity
The Z3 — Instructions on Film Control a Working Machine
Commercial demand · lens spotlight
Konrad Zuse’s Z3 combined binary floating-point arithmetic, relay control, and instructions on punched film in a working program-controlled machine used for aeronautical calculation. The original was destroyed in the war and familiar museum machines are later reconstructions. Instructions were not stored in internal memory, so precise features matter more than ranking it as the first computer in every sense.
PAUSE AND ASK
If instructions are punched on film and relays calculate binary numbers, does a paper design become a repeatedly running physical program?
How the idea changed
The Z3 read sequential instructions from punched film and performed binary floating-point operations with relays. Separating instructions from hardware let the same machine follow different calculation sequences, while its operational design lacked internal stored programs and general conditional branching.
What this place made possible
Berlin engineering education, a workshop in Zuse's parents' flat, limited aeronautical-research support, and demand for aircraft calculation linked a largely private construction effort to wartime industry. Bombing destroyed the original and some records; the familiar Z3 is a later reconstruction.
How it moved
Repeated civil-engineering calculation and Z1/Z2 experiments → telephone relays and instructions punched in discarded film → 1941 Z3 demonstration and aeronautical work → wartime destruction → Zuse's 1960s reconstruction and historical reassessment
Do not overclaim
The Z3 was a working program-controlled digital calculator, but it did not store instructions in internal memory or demonstrate modern operational generality during the war. Precise capabilities replace a claim to be the world's first computer in every sense.
Evidence sources
- Deutsches Museum — Computers exhibition
  Supports: The Z3's relay and punched-film structure, 1941 operation, and later reconstruction on display
- Computer History Museum — 1941: Zuse completes Z3
  Supports: The Z3's program control, binary floating point, and destruction during the war
Stable link to this scene
BerlinPhiladelphia
14 · 1946 CE
Philadelphia · Main activity
ENIAC — Programming Was Wiring and Human Work
Commercial demand · lens spotlight
Six women selected from the human computers who calculated firing tables learned ENIAC’s logic and programmed it by arranging cables and switches. Electronic calculation was fast, but changing problems took lengthy setup. This friction and the ENIAC–EDVAC team’s discussions helped develop stored-program design; the history cannot be reduced to one builder or to von Neumann alone.
PAUSE AND ASK
On an electronic machine without instructions in memory, whose labour—and what kind of labour—was the program?
How the idea changed
An ENIAC program decomposed a problem across accumulators, function tables, and control units, then physically reconfigured cables and switches. Electronics made arithmetic dramatically faster while problem changes remained slow, making the value of storing and editing instructions like data newly visible.
What this place made possible
Philadelphia's Moore School assembled U.S. Army Ballistic Research Laboratory funding, electronic engineers, and women who had computed firing tables by hand. Six early programmers learned diagrams and machine logic to make ENIAC work, yet were long marginalized in captions and credit.
How it moved
Wartime firing-table demand and women human computers → Eckert and Mauchly's electronic ENIAC team → plugboard programming by Bartik, Holberton, Meltzer, McNulty, Spence, and Teitelbaum → EDVAC discussions and stored-program reports → education and industrial computing
Do not overclaim
1946 marks the public unveiling; the machine had already run calculations in 1945. Even where ENIAC is classed as the first general-purpose electronic computer, that is not the same as stored-program operation, and no one group of designers, patrons, builders, or programmers receives the whole achievement.
Evidence sources
- Computer History Museum — 1946: ENIAC introduced
  Supports: ENIAC's unveiling, electronic architecture, scale, and method of changing programs
- Computer History Museum — Jean Jennings Bartik
  Supports: Bartik's path from human computer to ENIAC programmer and the women's material programming labour
Stable link to this scene
PhiladelphiaManchester
15 · 1948 CE
Manchester · Main activity
Manchester Baby — Writing Instructions into Memory
On 21 June 1948 the Small-Scale Experimental Machine, or Baby, ran a seventeen-instruction highest-factor program stored in electronic memory. Freddie Williams, Tom Kilburn, Geoff Tootill, and expertise and equipment from the wartime Telecommunications Research Establishment made the experiment possible. The important shift is the editable stored program, not an absolute first-computer ranking.
PAUSE AND ASK
If instructions occupy the same memory as numbers, can a machine's task change without rewiring its cables?
How the idea changed
The Manchester Baby fetched instructions from Williams–Kilburn electronic memory, repeated according to results, and ran a seventeen-instruction highest-factor program. As a program became a readable and editable memory pattern rather than fixed wiring, machine construction and program writing began to separate operationally.
What this place made possible
The University of Manchester brought together radar-memory expertise carried from the wartime Telecommunications Research Establishment by Williams, Kilburn, and Tootill, university laboratory space, and a later Ferranti industrial link to test an unstable new memory in a small experimental machine.
How it moved
Wartime cathode-ray radar techniques → Williams–Kilburn storage-tube experiments → construction of the SSEM/Baby → stored-program run on 21 June 1948 → Manchester Mark 1 and Ferranti Mark 1 → software work and a computer industry
Do not overclaim
The Baby was a small experimental memory testbed, not claimed as the first computer in every category. Its key evidence is an executed electronically stored program, with joint credit to Williams, Kilburn, Tootill, and the wartime research network rather than a ranking slogan.
Evidence sources
- University of Manchester — The Baby
  Supports: The SSEM builders, memory-test purpose, 21 June 1948 program, and seventeen instructions
- University of Manchester — Baby's 65th birthday
  Supports: The university record of stored-program execution and subsequent Manchester Mark 1 development
Stable link to this scene
ManchesterAmsterdam
16 · 1956 CE
Amsterdam · Main activity
Dijkstra — From Machine Demonstration to Reusable Algorithm
Commercial demand · lens spotlight
For the 1956 inauguration of the ARMAC computer, Dijkstra designed a method for finding the shortest route between Dutch cities so a general audience could understand the demonstration. He later recalled conceiving it over coffee with his fiancée Ria in about twenty minutes, but publication came in 1959. A reusable algorithm also needs its conditions made explicit: this method cannot simply accept negative edge weights.
PAUSE AND ASK
What must be stated to turn a shortest-route idea into a procedure whose answer can be checked on other maps and computers?
How the idea changed
Dijkstra's method extends settled shortest distances from a source by repeatedly selecting the nearest unsettled vertex. A one-off demonstration problem became a reusable algorithm with an input graph, selection rule, termination, and correctness condition—and a visible boundary where negative edge weights break the guarantee.
What this place made possible
Amsterdam's Mathematisch Centrum ARMAC team needed a demonstration whose result non-specialists could understand when inaugurating a Dutch-built computer. A legible city map and the real machine's limits favoured an elegant, memory-conscious procedure.
How it moved
Mathematisch Centrum computing service and ARMAC construction → a shortest-route problem for the 1956 public demonstration → Dijkstra's later café-terrace recollection → 1959 graph-connectivity paper → routing, GIS, algorithms education, and variants
Do not overclaim
The twenty-minute café story is Dijkstra's later recollection, not a contemporaneous record. The method was devised for a 1956 demonstration but published in 1959, and it cannot be applied unchanged to graphs with negative edge weights.
Evidence sources
- CWI — E. W. Dijkstra: brilliant, colourful, and opinionated
  Supports: Mathematisch Centrum, ARMAC, the 1956 shortest-path demonstration, and Dijkstra's Amsterdam career
- Dijkstra Archive — EWD1166 interview
  Supports: Dijkstra's later oral recollection of conceiving the shortest-path algorithm with Ria at a café terrace in about twenty minutes
- Dijkstra — A note on two problems in connexion with graphs
  Supports: The original 1959 paper presenting the shortest-path and minimum-spanning-tree procedures
Stable link to this scene

TOUCH THE MATHEMATICS

The 1200-Year Journey of the Word "Algorithm"

Al-Khwarizmi’s name became the Latin *Algoritmi*, while a procedure followed by a person moved into gears, punched cards, logic circuits, and stored programs. The journey then continues through the FFT, PageRank, and Transformers—not as one straight lineage, but through translation, independent discovery, unbuilt machines, and team labour.

Continue with the 152-second cinematic journey

OPEN THE FULL MAP

Follow the river of computation and computer science

Leave the edited sixteen scenes and compare other people, problems, hubs, and routes in algorithms, logic, machines, and information theory on the live map.

Explore the full map

16 scroll-controlled map scenes

Al-Khwarizmi — Writing Calculation as a Procedure

Latin Algoritmi — A Name Becomes a Method

The Pascaline — Delegating Carrying to Gears

Babbage — Designing a Machine for More Than One Table

Ada Lovelace — Seeing Machine and Program as Distinct

Boole — Calculating with Forms of Reasoning

Hollerith — Counting a Population with Punched Cards

Hilbert and Ackermann — Can Every Logical Problem Be Decided?

Gödel — Formalization Reveals Its Own Limits

Church — Defining Computation Through Function Substitution

Turing — Modelling a Procedure as a Machine

Shannon — Turning Logical Expressions into Relay Circuits

The Z3 — Instructions on Film Control a Working Machine

ENIAC — Programming Was Wiring and Human Work

Manchester Baby — Writing Instructions into Memory

Dijkstra — From Machine Demonstration to Reusable Algorithm

The 1200-Year Journey of the Word "Algorithm"

Follow the river of computation and computer science