Lectures

All chapters are taken from Theory of Computation by Michael Sipser. The corresponding lecture slides will be released on Ed prior to the lecture.

Date # Topic Chapters
Sep 8 1 Course Overview --
Sep 13 2 DFAs 1.1
Sep 15 3 NFAs 1.2
Sep 20 4 Regular Expressions 1.3
Sep 22 5 The Pumping Lemma 1.4
Sep 27 6 Context-Free Grammars 2.1
Sep 29 7 Pushdown Automata 2.2
Oct 4 8 NCFLs 2.3
Oct 6 9 Turing Machines 3.1
Oct 11 10 Turing Machine Variations 3.2
Oct 13 11 Algorithms 3.3
Oct 18 12 Undecidable Languages 4
Oct 20 13 Reducibility 5.1-2
Oct 25 14 Mapping Reducibility 5.3
Oct 27 15 Time Complexity 7.1
Nov 1 16 P and NP 7.2-3
Nov 3 17 More on NP 7.4
Nov 10 18 NP and CoNP 7.5
Nov 15 19 Space Complexity I 8.1-2
Nov 17 20 Space Complexity II 8.3
Nov 29 21 L and NL 8.4-6
Dec 1 22 Games and Space Complexity 8.4-6
Dec 6 23 Intractability 9.1-3
Dec 8 24 Randomization TBD