15453 Formal Languages, Automata, and Computation
Lecture 25: The LambdaCalculus
We begin with the proof that the tiling problem from lecture 24 is
undecidable. Then we examine Church's lambdacalculus, another universal
model of computation (the "Church" part in the ChurchTuring Thesis).
 Reading: notes in preparation
 Previous lecture: Tiling
 Next lecture: Review
[ Home
 Schedule
 Assignments
 Handouts
 Overview
]
fp@cs
Frank Pfenning
