Author thumbnail

MIT OpenCourseWare

MIT 18.404J Theory of Computation, Fall 2020

408,633 views
25 items
Last updated on Oct 7, 2021
public playlist
1. Introduction, Finite Automata, Regular Expressions
1:00:34
2. Nondeterminism, Closure Properties, Conversion of Regular Expressions to FA
1:03:27
3. Regular Pumping Lemma, Conversion of FA to Regular Expressions
1:10:02
4. Pushdown Automata, Conversion of CFG to PDA and Reverse Conversion
1:09:23
5. CF Pumping Lemma, Turing Machines
1:13:59
6. TM Variants, Church-Turing Thesis
1:14:49
7. Decision Problems for Automata and Grammars
1:16:51
8. Undecidability
1:17:02
9. Reducibility
1:16:37
10. Computation History Method
1:21:41
11. Recursion Theorem and Logic
1:17:32
12. Time Complexity
1:25:37
14. P and NP, SAT, Poly-Time Reducibility
1:19:23
15. NP-Completeness
1:25:53
16. Cook-Levin Theorem
1:18:27
17. Space Complexity, PSPACE, Savitch's Theorem
1:20:10
18. PSPACE-Completeness
1:17:36
19. Games, Generalized Geography
1:19:38
20. L and NL, NL = coNL
1:20:06
21. Hierarchy Theorems
1:21:57
22. Provably Intractable Problems, Oracles
1:22:50
23. Probabilistic Computation, BPP
1:23:41
24. Probabilistic Computation (cont.)
1:23:16
25. Interactive Proof Systems, IP
1:14:30
26. coNP is a subset of IP
1:23:30