SAME PLACE · 272 YEARS · TWO ROUTES · TWO READINGS
Cambridge — From Inverse Tangents and Areas to the Limits of Computable Procedure
Cambridge·1664 CE → 1936 CE·2 routes · 2 readings
Barrow's 1664 lectures approached the inverse relation between tangent and accumulated area; Turing's 1936 work abstracted a human-followed procedure into a machine and asked where computation ends.
QUESTION FOR THIS CROSSING
Across layers of lectures, students, and publication, how did 'Why are these calculations inverse?' and 'What is a procedure?' become public questions?
COMPARISON BOUNDARY
One Cambridge coordinate does not make seventeenth-century Lucasian lectures and the twentieth-century King's College and publication setting one institutional structure. The 272 years of change and distinct problems remain visible.
ONE CROSSING WITHIN 21
Keep the surrounding geography visible
Every marker stays visible. The amber marker is the current place; the dotted line remains a viewer itinerary rather than a historical route.
지도를 불러오는 중…
Same place · different time layers
Compare the route readings
Barrow studies geometric relations among curves; Turing the possible scope of symbol manipulation. Explicit procedure does not establish direct lineage or inevitability from calculus to computers.
1. Calculus from Many Springs — Change and Accumulation Become One Language
1664 CE · Teaching / position
At the Threshold where Tangents and Areas Undo One Another — Barrow's Lectures
In Cambridge geometry lectures, Isaac Barrow showed that the tangent to a curve representing accumulated area is related to the original curve. Newton attended and helped prepare the lectures for publication. The result comes remarkably close to the fundamental theorem, but it is not the identical modern statement with today's functions, continuity hypotheses, and notation.
QUESTION FROM THIS ROUTE
Why does differentiating the new curve formed by accumulated area recover the original height?
What became newly visible
Reveal geometrically that tangent and area problems are not separate but two directions through one process.
Why this place could enable it
Cambridge's first Lucasian chair, lectures, students, and manuscript publication placed Barrow's geometry close to the young Newton's calculations.
What actually moved
Area and tangent work by Cavalieri and Torricelli → Barrow's Cambridge lectures → Newton's attendance and editorial help → generalization of the inverse relation between rate and accumulation
DO NOT OVERREAD THIS SCENE
It comes very close to the modern Fundamental Theorem, but is not retrospectively described as the identical theorem with today's functions, continuity assumptions, and notation.
2. When Symbols Became Machines — From Written Procedures to Stored Programs
1936 CE · 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.
QUESTION FROM THIS ROUTE
By imagining a person who sees one square of paper and follows fixed rules, can the act of computation be defined through minimal operations?
What became newly visible
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.
Why this place could enable it
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.
What actually 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 OVERREAD THIS SCENE
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.