15-453 Formal Languages, Automata, and Computation
Lecture 25: The Lambda-Calculus

We begin with the proof that the tiling problem from lecture 24 is undecidable. Then we examine Church's lambda-calculus, another universal model of computation (the "Church" part in the Church-Turing Thesis).

  • Reading: notes in preparation
  • Previous lecture: Tiling
  • Next lecture: Review

[ Home | Schedule | Assignments | Handouts | Overview ]

Frank Pfenning