15-453 Formal Languages, Automata, and Computation
Lecture 26: Review

We finish the brief overview of the lambda-calculus by showing how to represent natural numbers and recursion. Then we review the material in the second part of the course, which explored the limits of what can be solved mechanically.