In this lecture, we probe deeper into the realm of undecidable problems. We learn a second way to define the $\relangs$ languages: special Turing machines called Verifiers.
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.