The Shoulders of Giants or Uncovering the Foundational Ideas of Lisp
summary
Traces the math crisis from Hilbert and Russell through Gödel to Church and Turing, pinpoints primitive recursive functions and the minimization operator as the exact technical gap that forces incompleteness, and notes Ackermann/Sudan as concrete non‑primitive examples. Shows equivalence: partial recursive = Turing‑computable. Recounts Lisp as a formalism over s‑expressions that replaces numeric recursion with recursion plus conditional on trees, builds a universal eval and a hand‑coded interpreter, and claims the Lisp description is terser than a universal Turing machine.
AI-written summary · about
chapters (12)
- 0:00Introduction and thanks
- 1:04Origins of Lisp theory
- 2:17Russell's Paradox and Hilbert's program
- 5:29Gödel's incompleteness theorems
- 8:47Rosa Peter and recursion theory
- 10:57Decision problem and computability
- 13:35Primitive recursive functions
- 17:48Partial recursive functions
- 21:20McCarthy's vision for Lisp
- 24:09Lisp and Lambda calculus confusion
- 26:16Lisp's universal function eval
- 27:19Conclusion and misconceptions
related talks
30mLambda Calculus: The Origins of Functional Programming
44mLet's Lisp like it's 1959
44m(Recursive) Functions Decoded
21mλ-Calculus: A Brief History of Functional Programming
44mTuring's Toy - The story of a mathematical idea that changed the world
36mAbstract Machines for Good
38mLearn you some Lisp for Great Good
43mParadigms Without Progress: Kuhnian Reflections on Programming Practice