Sixth Assignment

Due Wednesday November 22

  1. Problem 1, page 309 of Kozen
  2. Problem 2, page 309 of Kozen
  3. Problem 3, page 309 of Kozen
  4. Read about enumeration machines on page 225 of Kozen. Prove:
    1. If a language L can be enumerated in increasing order, it is computable
    2. If a language and its complement are both enumerable, L is computable

Extra Credit for the Mathematically Inclined

Problem 95, page 339