Orthogonal Remarks
summary
A 1959 thesis converts flowcharts to directed graphs and uses matrix and topological arguments to reason about program paths, then includes a full UNIVAC I machine code implementation of the Euclidean algorithm that reads 100 pairs and writes GCDs. Careful simulation finds a bug in instruction 39 (L register not cleared) and an undocumented limitation: the routine only works reliably when the smaller operand is at most six digits and the larger/smaller ratio stays below about 10^5. Program analysis and historical service stats (9 program committees, 31‑year longevity) are documented.
AI-written summary · about
chapters (6)
- 0:00Introduction and reflections
- 2:26Analysis of Karp's PhD thesis
- 10:15UNIVAC programming insights
- 19:48Seminar history and legacy
- 25:41Teaching and community impact
- 28:16Closing remarks
