53:51

L17: Using Reductions to Prove Language Undecidable

1:13:16

L13: Diagonalization, Countability and Uncountability

1:19:07

L12: Universal Turing Machines; The Halting Problem is Recognizable but Not Decidable

1:21:10

L19: Uncomputable Functions, and Introduction to Complexity

40:08

L16: Unrecognizable Languages and Reductions

1:14:50

L18: More Complex Reductions

1:18:38

L7: Contex-Free Grammars and Push-Down Automata

1:14:56

L8: Introduction to Turing Machines and Computations