Lecture 28

Learning objectives

After this class, you should be able to:

1. Define a nondeterministic Turing machine (NDTM).
2. Given a NDTM and a string, show a possible sequence of moves of the machine on that string.
3. Explain the difference between an NDTM accepting a language and deciding a language.
4. Given a language, construct an NDTM that accepts it or decides it.
5. Show that the class of deterministic Turing machines is equivalent to the class of NDTMs.

Reading assignment

1. Sections 10.3.
2. Lecture 28 slides on Blackboard.

Exercises and review questions

• Exercises and review questions on current lecture's material
  1. Section 10.3, exercise #3 (your NDTM should not be deterministic).
  2. Section 10.3, exercise #6.

• Questions on next lecture's material
  1. None.

---

Last modified: 12 Mar 2014