Lecture 30

Learning objectives

After this class, you should be able to:

1. Define an enumeration procedure.
2. Show that the set of Turing machines is countable.
3. Given a set, prove that it is countable or give an enumeration procedure for it.

Reading assignment

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

Exercises and review questions

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

• Questions on next lecture's material
  1. Is the machine that you constructed for section 10.4 exercise #1 (Lecture 29) a linear bounded automaton?

---

Last modified: 12 Mar 2014