Lecture 29

Learning objectives

After this class, you should be able to:

1. Explain the idea of a universal Turing machine, and show how it can simulate a Turing machine given an encoding of that machine.
2. Given a Turing machine, give its encoding.

Reading assignment

1. Sections 10.4.
2. Lecture 29-30 slides on Blackboard.
3. Page 271.

Exercises and review questions

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

• Questions on next lecture's material
  1. Define an enumeration procedure.

---

Last modified: 12 Mar 2014