1:21:41

10. Computation History Method

1:17:02

8. Undecidability

1:25:25

16. Complexity: P, NP, NP-completeness, Reductions

1:00:34

1. Introduction, Finite Automata, Regular Expressions

1:13:59

5. CF Pumping Lemma, Turing Machines

1:16:51

7. Decision Problems for Automata and Grammars

1:20:06

20. L and NL, NL = coNL

7:58

Are There Problems That Computers Can't Solve?