| Date | Due | Topic | Chapter | ||
| Th | Oct 30 | Introduction | |||
| Fr | Oct 31 | Decidability vs. Undecidability | |||
| Mo | Nov 03 | Turing Machines | 3.1 | ||
| Tu | Nov 04 | Quiz I | Variants of Turing Machines | 3.2 | |
| Th | Nov 06 | Recursive Functions | |||
| Fr | Nov 07 | Church-Turing Thesis | 3.3 | ||
| Mo | Nov 10 | Hw I | Decidability I | 4.1 | |
| Tu | Nov 11 | Quiz II | Decidability II | 4.1 | |
| Th | Nov 13 | Undecidability | 4.2 | ||
| Fr | Nov 14 | R.E. Sets, Arithmetical Hierarchy | |||
| Mo | Nov 17 | Hw II | Reducibility | 5.1 | |
| Tu | Nov 18 | Quiz III | Reducibility via Computation Histories | 5.1 | |
| Th | Nov 20 | Post Correspondence Problem | 5.2 | ||
| Fr | Nov 21 | Many-to-one Reducibility, Turing Reducibility | 5.3, 6.3 | ||
| Mo | Nov 24 | Hw III | Review | ||
| Tu | Nov 25 | ** EXAM 1 ** | |||
| Th | Nov 27 | Thanksgiving Break - No classes | |||
| Fr | Nov 28 | Thanksgiving Break - No classes | |||
| Mo | Dec 01 | Time Complexity I | 7.1 | ||
| Tu | Dec 02 | Time Complexity II | 7.1, 7.2 | ||
| Th | Dec 04 | Class P | 7.2 | ||
| Fr | Dec 05 | Class NP - Polynomial Verifiability | 7.3 | ||
| Mo | Dec 08 | Hw IV | P vs. NP | 7.3 | |
| Tu | Dec 09 | Quiz IV | NP-completeness - Reducibility | 7.4 | |
| Th | Dec 11 | NP-completeness - Examples | 7.4 | ||
| Fr | Dec 12 | NP-completeness, Polynomial Hierarchy | 7.5 | ||
| Mo | Dec 15 | Hw V | Coping with NP-completeness | 10.1 | |
| Tu | Dec 16 | Quiz V | Review | ||
| Th | Dec 18 | ** EXAM 2 ** | |||
| Fr | Dec 19 | Final Remarks |