Sixth Assignment
Due Wednesday November 22
- Problem 1, page 309 of Kozen
- Problem 2, page 309 of Kozen
- Problem 3, page 309 of Kozen
- Read about enumeration machines on page 225 of Kozen.
Prove:
- If a language L can be enumerated in increasing order, it is computable
- If a language and its complement are both enumerable, L is
computable
Extra Credit for the Mathematically Inclined
Problem 95, page 339