15-453 Formal Languages, Automata, and Computation
Lecture 19: Reductions

We discuss the importance of Turing machines and the undecidability of the halting problem in the history of computer science. Then we introduce the technique of reduction in order to prove undecidability.

This lecture is given by Mihai Budiu.

• Reading: Ch. 5.3, pp. 189-194
• Slides in HTML and PostScript from the lecture
• Previous lecture: The Halting Problem
• Next lecture: Some Undecidable Problems

[ Home | Schedule | Assignments | Handouts | Overview ]

fp@cs
Frank Pfenning