This calendar contains the most up-to-date information about deadlines. Check back for changes.
Submit everything in Gradescope. If you miss class, Labs can be found in Gradescope and should be submitted individually. Problem Sets can be found in Gradescope as well.
Last updated: January 2, 2025
| Date | Topics/Activities | Readings and Deadlines |
|---|---|---|
| Tu Jan 21 | Introduction to the Course, Review of Proofs | To-do: before the first day of class |
| Th Jan 23 | Mathematical Literacy | Reading: Sipser Chapter 0 |
| Sun Jan 26 | Due: Labs from 1/21 and 1/23 | |
| Tu Jan 28 | Finite Automata | Reading: Sipser §1.1 Released today: Problem Set 1 |
| Th Jan 30 | Nondeterminism | Reading: Sipser §1.2 |
| Sun Feb 2 | Due: Labs from 1/28 and 1/30 | |
| Tu Feb 4 | Regular Expressions | Reading: Sipser §1.3 Due: Problem Set 1 Released today: Problem Set 2 |
| Th Feb 6 | Regular Models | Reading: Decision Procedures |
| Sun Feb 9 | Due: Labs from 2/4 and 2/6 | |
| Tu Feb 11 | Irregularity | Reading: Sipser §1.4 Due: Problem Set 2 Released today: Problem Set 3 |
| Th Feb 13 | Context-Free Grammars | Reading: Sipser §2.1 |
| Sun Feb 16 | Due: Labs from 2/11 and 2/13 | |
| Tu Feb 18 | Turing Machines | Reading: Sipser §3.1 Due: Problem Set 3 Released today: Problem Set 4 |
| Th Feb 20 | Variants of Turing Machines | Reading: Sipser §3.2 |
| Sun Feb 23 | Due: Labs from 2/18 and 2/20 | |
| Tu Feb 25 | Time Complexity | Reading: Sipser §7.1 and §7.2 Due: Problem Set 4 |
| Th Feb 27 | Exam 1 | |
| Sun Mar 2 | Due: Lab from 2/23 | |
| Tu Mar 4 | NP-completeness | Reading: Sipser §7.3 through page 304 |
| Th Mar 6 | The Cook-Levine Theorem | Reading: Sipser pg 304-311 |
| Mar 10 - Mar 21 | No Class: Spring Break | |
| Sun Mar 23 | Due: Labs from 3/4 and 3/6 | |
| Tu Mar 25 | More NP-completeness | Reading: Sipser §7.5 Released today: Problem Set 5 |
| Th Mar 27 | Savitch's Theorem | Reading: Sipser §8.1 and §8.2 |
| Sun Mar 30 | Due: Labs from 3/25 and 3/27 | |
| Tu April 1 | PSPACE-completeness | Reading: Sipser §8.3 Due: Problem Set 5 Released today: Problem Set 6 |
| Th April 3 | L and NL | Reading: Sipser §8.4 - §8.6 |
| Sun April 6 | Due: Labs from 4/1 and 4/3 | |
| Tu April 8 | Intractability | Reading: Sipser §9.1 and §9.2 Due: Problem Set 6 |
| Th April 10 | Exam 2 | |
| Sun April 13 | Due: Lab from 4/8 | |
| Tu April 15 | Decidability | Reading: Sipser §4.1 |
| Th April 17 | Undecidability | Reading: Sipser §4.2 |
| Sun April 20 | Due: Labs from 4/15 and 4/17 | |
| Tu April 22 | Reducibility | Reading: Sipser §5.1 and §5.3 Released today: Problem Set 7 |
| Th April 24 | A simple, undecidable problem | Reading: Sipser §5.2 |
| Sun April 27 | Due: Labs from 4/24 and 4/27 | |
| Tu April 29 | Rice's Theorem | Reading: Rice’s Theorem Due: Problem Set 7 Released today: Problem Set 8 |
| Th May 1 | The Recursion Theorem | Reading: Sipser §6.1 and §6.2 |
| Sun May 4 | Due: Labs from 4/29 and 5/1 | |
| Tu May 6 | Approximation Algorithms | Reading: Sipser §10.1 and §10.2 Due: Problem Set 8 |
| Th May 8 | Wrap-up, course evaluations | No reading today! |
| Sun May 11 | Due: Labs from 5/6 and 5/8 | |
| Friday May 16 | Exam 3, 9am - 10:20am |