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
File Attachments
Lecture Recording
The complete archive of this quarter's lecture recordings is available on Canvas.
Today's recording will be embedded on this page shortly after lecture.