If links do not work in the table below, it likely means that they aren’t set to be released in Gradescope yet. If you believe something should be already released, shoot me an email.
| Date | Topics/Activities | Readings and Deadlines | Lab |
|---|---|---|---|
| T Jan 25 | Introduction to the Course, Review of Proofs | To-do before the first day of class | 1/25 |
| Th Jan 27 | Mathematical Literacy | Reading: Sipser: Chapter 0 Released today: Problem Set 1 | 1/27 |
| Sat Jan 29 | Due: Labs from 1/25 and 1/27 | ||
| T Feb 1 | Finite Automata | Reading: Sipser: Section 1.1 | 2/1 |
| Th Feb 3 | Nondeterminism | Sipser: Section 1.2 You can just skim the section on Equivalence of NFAs and DFAs. | 2/3 |
| Sat Feb 5 | Labs from 2/1 and 2/3 | ||
| T Feb 8 | Regular Expressions | Reading: Sipser Section 1.3 Due: Problem Set 1 Released today: Problem Set 2 | 2/8 |
| Th Feb 10 | Regular Models | Reading: Decision Procedures and questions | 2/10 |
| Sat Feb 12 | Labs from 2/8 and 2/10 | ||
| T Feb 15 | Irregularity | Reading: Sipser: Section 1.4 | 2/15 |
| Th Feb 17 | Context-Free Grammars | Reading: Sipser: Section 2.1 Released today: Problem Set 3 Due: Problem Set 2 | 2/17 |
| Sat Feb 19 | Labs from 2/15 and 2/17 | ||
| T Feb 22 | Turing Machines | Reading: Sipser: 3.1 | 2/22 |
| Th Feb 24 | Variants of Turing Machines | Reading: Sipser 3.2 Quiz opens today in Gradescope | 2/24 |
| Sat Feb 26 | Labs from 2/22 and 2/24 | ||
| T Mar 1 | No Class: Working Differently Day | Reading: Sipser 3.3 Due: Problem Set 3 | |
| Th Mar 3 | Time Complexity | Reading: Sipser 7.1-7.2 Released today: Problem Set 4 | 3/3 |
| Sat Mar 5 | Lab from 3/3 | ||
| T Mar 8 | NP-completeness | Reading: Sipser 7.3 through page 304 | 3/8 |
| Th Mar 10 | The Cook-Levine Theorem | Reading: Sipser pg 304-311 | 3/10 |
| Sat Mar 12 | Labs from 3/8 and 3/10 | ||
| T Mar 15 | More NP-completeness | Reading: Sipser 7.5 Due today: Problem Set 4 | 3/15 |
| Th Mar 17 | Savitch's Theorem | Reading: Sipser 8.1-8.2 | 3/17 |
| Sat Mar 19 | Labs from 3/15 and 3/17 | ||
| 3/22 - 3/31 | No Class: Spring Break | Problem Set 5 posted | |
| T April 5 | PSPACE-completeness | Sipser 8.3 | 4/5 |
| Th April 7 | Catch-up day | No reading today! Quiz opens today | 4/7 |
| Sat April 9 | Labs from 4/5 and 4/7 | ||
| T April 12 | L and NL | Sipser 8.4-8.6 Problem Set 5 due | 4/12 |
| Th April 14 | Intractability | Sipser 9.1 | 4/14 |
| Sat April 16 | Labs from 4/12 and 4/14 | ||
| T April 19 | Decidability | Sipser 4.1 | 4/19 |
| Th April 21 | Undecidability | Sipser 4.2 Problem Set 6 released today | 4/21 |
| Sat April 23 | Labs from 4/19 and 4/21 | ||
| T April 26 | Reducibility | Sipser 5.1 and 5.3 After reading Sipser, review this overview on the proof strategies from the reading. | 4/26 |
| Th April 28 | A simple, undecidable problem | Sipser 5.2 | 4/28 |
| Sat April 30 | Labs from 4/26 and 4/28 | ||
| T May 3 | Rice's Theorem | Reading, and link to questions Problem Set 6 due Problem Set 7 released today | 5/3 |
| Th May 5 | The Recursion Theorem | Sipser 6.1 Quiz opens today | |
| Sat May 7 | Labs from 5/3 and 5/5 | ||
| T May 10 | Approximation Algorithms | Sipser 10.1 Problem Set 7 due | |
| Th May 12 | Wrap-up, course evaluations | No reading today! | |
| Sat May 13 | Labs from 5/10 and 5/12 | ||
| May 16 | Exam Week | Quiz Make-ups (optional) |