- Example: construct tiles for simple machine and trace accepting and rejecting
computations with them
- Generate the tiles
- Generating a computation history while finding a match
- Generate the tiles
- Ambiguity in CFGs is undecidable
- Read problem 5.21
- Intro to the Recursion Theorem (time permitting)
- “Turing machines can obtain their own descriptions”