L9: More TM Design and Introduction to Non-Determinstic TMs
1:16:05
L10: Equivalence of Non-Deterministic and Deterministic TMs
1:18:38
L7: Contex-Free Grammars and Push-Down Automata
1:14:56
L8: Introduction to Turing Machines and Computations
53:51
L17: Using Reductions to Prove Language Undecidable
1:20:57
L2: Regular Languages and Non-Deterministic FSMs
1:19:07
L12: Universal Turing Machines; The Halting Problem is Recognizable but Not Decidable
1:18:05
L11: Church-Turing Thesis and Examples of Decidable Languages
1:17:52