18.404J/6.840J The Theory of Computation(Fall 2020, MIT OCW). Instructor: Prof. Michael Sipser. This course emphasizes computability and computational complexity theory. Topics include regular and context-free languages, decidable and undecidable problems, reducibility, recursive function theory, time and space measures on computation, completeness, hierarchy theorems, inherently complex problems, oracles, probabilistic computation, and interactive proof systems.
(from ocw.mit.edu)
Lecture 08 - Undecidability
Quickly reviewed last lecture. Showed that N and R are not the same size to introduce the diagonalization method and used it to prove ATM is undecidable. Introduced the reducibility method to show that HALTTM is undecidable.