| Date | Lecture | Topic | Reading |
|---|
| 9/8 | 1 | Overview of the Course | Chapt. 1 |
| 9/13 | 2 | Computational Models I | Chapt. 1 |
| 9/15 | 3 | Computational Models II | Chapt. 1 |
| 9/20 | 4 | Proof Methodologies | |
| 9/22 | 5 | Nondeterministic Computation | Sect. 3.1 |
| 9/27 | 6 | Design of Logic Circuits | Sect. 2.2, 2.3 |
| 9/29 | 7 | Shifting and Other Problems | Sect. 2.3.4, 2.5.2, 2.54, 2.12 |
| 10/4 | 8 | The Random Access Machine | Sect. 3.4-3.6 |
| 10/6 | 9 | TM Language Recognition | Sect. 3.7, 5.1, 5.2.1, 5.5 |
| 10/11 | 10 | Introduction to Complexity Classes | Sect. 3.9.6, 8.7 |
| 10/13 | 11 | A First NP-Complete Language | Sect. 3.9.1, 3.9.2, 3.9.3 |
| 10/18 | 12 | Proving a Language NP-Complete | Sect. 8.10.1, 8.10.2 |
| 10/20 | 13 | Review I | |
| 10/25 | 14 | Equivalence of the DFSM and FSM | Sect. 4.2 |
| 10/27 | 15 | Regular Expressions are Recognized by FSMs | Sect. 4.3, 4.4.1 |
| 11/1 | 16 | FSMs Recognize Regular Expressions | Sect. 4.4.2 |
| 11/3 | 17 | The Chomsky Language Hierarchy | Sect. 4.9 |
| 11/8 | 18 | Parsing Context-Free Languages | Sect. 4.10, 4.11 |
| 11/10 | 19 | Context-Free and Phrase Structure Languages | Sect. 4.13 |
| 11/15 | 20 | Review II | |
| 11/17 | | Midterm II | |
| 11/21 | 21 | Limits to Language Recognition | Sect. 5.6, 5.7, 5.8, 8.2, 8.3 |
| 11/24 | | Thanksgiving | |
| 11/29 | 22 | Approximations
to Hard Problems | |
| 12/1 | 23 | Space-Time Tradeoffs | |
| 12/6 | 24 | Memory
Hierarchies and Review III | Sect. 8.8, 8.9, 8.14 |
