L15: Proof by Diagonalization that ATM (Halting Problem) is Not Decidable
53:51
L17: Using Reductions to Prove Language Undecidable
1:13:16
L13: Diagonalization, Countability and Uncountability
1:18:05
L11: Church-Turing Thesis and Examples of Decidable Languages
40:08
L16: Unrecognizable Languages and Reductions
1:21:10
L19: Uncomputable Functions, and Introduction to Complexity
1:16:37
9. Reducibility
6:14
Turing & The Halting Problem - Computerphile
7:58