Lecture 32

Learning objectives

After this class, you should be able to:

1. Define recursively enumerable and recursively languages.
2. Prove the existence of non-recursively enumerable languages by counting arguments and by construction.
3. Prove properties or recursive and recursively enumerable languages.

Reading assignment

1. Sections 11.1.
2. Lecture 32 slides on Blackboard.

Exercises and review questions

• Exercises and review questions on current lecture's material
  1. Section 11.1, exercise #2.
  2. Section 11.1, exercise #5.
  3. Section 11.1, exercise #12.

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

---

Last modified: 12 Mar 2014