CSCI 0510 - Models of Computation
| Lecture | Topic | Date | In | Out |
|---|---|---|---|---|
| 1 | Introduction, FSMs | 9/9 | HW 0, HW 1 | |
| 2 | DFA's, Regular Languages | 9/14 | HW 0 | |
| 3 | More DFA's, Regular Languages | 9/16 | HW 1 | HW 2 |
| 4 | NFA's | 9/21 | ||
| 5 | Regular Expressions | 9/23 | HW 2 | HW 3 |
| 6 | Pumping lemma | 9/28 | ||
| 7 | Turing Machines | 9/30 | HW 3 | HW 4 |
| 8 | Turing Machine Variants | 10/5 | ||
| 9 | Context Free Grammars | 10/7 | HW 4 | HW 5 |
| 10 | Reductions, Unrecognizability | 10/14 | HW 5 | |
| 11 | Midterm review | 10/19 | ||
| 12 | Mapping Reducibility | 10/21 | HW 6 | |
| 13 | Intro to Time Complexity | 10/26 | ||
| 14 | Classes P and NP | 10/28 | HW 6 | HW 7 |
| 15 | Polytime reductions | 11/2 | ||
| 16 | NP complete problems | 11/4 | HW 7 | HW 8 |
| 17 | Cook Levin | 11/9 | ||
| 18 | More NP-Complete Problems | 11/11 | HW 8 | Midterm 2 |
| 19 | Time Complexity | 11/16 | ||
| 20 | Class Relationships | 11/18 | Midterm 2 | |
| 21 | PSPACE Completeness | 11/23 | HW 9 | |
| 22 | P/Poly, Probabilitist Computation | 11/30 | ||
| 23 | More Prob Comp, Interactive Proofs | 12/2 | HW 9 | HW 10 |
| 24 | L and NL | 12/7 | ||
| 25 | NL=coNL, Circuits | 12/9 | HW 10 |