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.
Readings
Links
Lecture Recording
The complete archive of this quarter's lecture recordings is available on Canvas.