Review of the undecidable language ATM, the Halting Problem; introduction to diagonalization and countability; proof by diagonalization that the real numbers are not countable.
See All 27 Episodes of "Theory of Computation - Fall 2011"