Lecture 34

Learning objectives

After this class, you should be able to:

1. Define computability and decidability.
2. Prove that the Turing machine halting problem is undecidable.
3. Given a problem, prove that it is undecidable (usually by reducing a known undecidable problem to the new problem).

Reading assignment

1. Sections 12.1.
2. Lecture 34 slides on Blackboard.

Exercises and review questions

• Exercises and review questions on current lecture's material
  1. Section 12.1, exercise #2.
  2. Section 12.1, exercise #3.
  3. Section 12.1, exercise #5.

• Questions on next lecture's material
  1. Section 14.1, exercise #1a.

---

Last modified: 19 Mar 2014