Lecture 36

Learning objectives

After this class, you should be able to:

1. Given the general description of an algorithm, give details of a Turing machine corresponding to the algorithm and derive its space and time complexity.
2. Define the following: DTIME(T(n)), NTIME(T(n)), P, NP, and intractable problem.
3. Given a language, give an efficient Turing machine for it and identify complexity classes to which the language belongs (such as DTIME(n2) and NTIME(n)).
4. Prove that there is no total Turing computable function f(n) such that every recursive language can be decided in time f(n), where n is the length of the input string.

Reading assignment

1. Sections 14.3 and 14.4.
2. Lecture 36 slides on Blackboard.

Exercises and review questions

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

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

---

Last modified: 15 Apr 2014