In this last lecture purely on computability theory, we probe deeper into the realm of undecidable problems, learn more about what the $\relangs$ languages are all about, and discover an unrecognizable language using a surprisingly familiar technique.
(view slides in the lecture itself)
Readings
- Readings: Guide to Self-Reference, Guide to the Lava Diagram
Links