From the 3rd edition of M. Sipser's Theory of Computation

• Week of January 21st Review of Sets, Functions, and Logic (Chapter 0, pages 1-16), Definition of Turing reducibility (Section 6.3)
• Week of January 28th Mapping Reducibility Definition (Pages 234-235)
• Week of February 3rd Measuring Complexity, Complexity Classes P and NP (Sections 7.1-7.3)
• Week of February 10th Measuring Complexity, Complexity Classes P and NP, NP-Completeness (Sections 7.1-7.4)
• Week of February 17th NP-Completeness and NP-Complete Problems (Sections 7.4, 7.5)
• Week of March 3rd Deterministic and Nondeterministic Finite Automata (Sections 1.1, 1.2)
• Week of March 10th Regular Expressions (Sections 1.3)
• Week of March 17th Regular Expressions, Converting Regular Expressions to NFA's, Converting NFA's to Regular Expressions (Sections 1.3)
• Week of March 24th. Context Free Languages and Grammars (Sipser Section 2.1)
• Week of April 7th: Turing Machines (Chapter 3 Section 1)
• Week of April 28th: Undecidability and the Diagonalization Method, Kleene's 2nd Recursion Theorem (pages 201 and 202, Section 6.1)
• Week of April 27th: Kleene's 2nd Recursion Theorem (Section 6.1)