Lecture 35

Learning objectives

After this class, you should be able to:

1. Explain how the time complexity of algorithms is computed.
2. Derive the time complexity required by a single tape Turing machine to simulate a O(n) time algorithm on a multitape Turing machine.
3. Derive the time complexity required by a deterministic Turing machine to simulate a O(n) time algorithm on a non-deterministic Turing machine.
4. Given a problem, give deterministic and non-deterministic Turing machines for it and give their time complexities.

Reading assignment

1. Sections 14.1 and 14.2.
2. Lecture 35 slides on Blackboard.
3. Page 352.

Exercises and review questions

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

• Questions on next lecture's material
  1. In which DTIME complexity class is the language anbn?

---

Last modified: 13 Apr 2014