Reading assignments are from Sipser, An Introduction to the Theory of Computation, second edition, available at the Textbook Annex.
Class meetings are MWF 1:25-2:15 in Marston 211. There are two evening midterm exams -- the regular classes those days are cancelled though I may use the first one as a makeup for snow cancellations.
PART I: Regular and Context-Free Languages
Mon 23 Jan L01 Course Overview (0.1)
Wed 25 Jan L02 Basic Definitions (0.2)
Fri 27 Jan L03 Review of Proof Techniques (0.3,0.4)
Mon 30 Jan L04 Deterministic Finite Automata (1.1)
Wed 01 Feb L05 Nondeterministic Finite Automata (1.2)
Fri 03 Feb L06 Regular Expressions, Proof of Kleene's Theorem (1.3)
Mon 06 Feb L07 Non-Regular Languages (1.4)
Wed 08 Feb L08 The Myhill-Nerode Theorem (1.4 plus)
Fri 10 Feb L09 Context-Free Languages and Grammars (2.1)
Mon 13 Feb L10 PDA's, Equivalence of CFL's and PDA's (2.2)
Wed 15 Feb L11 Non-Context-Free Languages, More Equivalence (2.3)
Fri 17 Feb L12 Properties of the Context-Free Languages (2.3)
Mon 20 Feb --- NO CLASS (President's Day Holiday)
Tue 21 Feb X01 FIRST MIDTERM (7-9 pm, 142 CMPSCI building) on Lectures 1-12
PART II: Turing Machines and Computability
Wed 22 Feb --- NO CLASS (Makeup for Midterm #1)
Fri 24 Feb L13 Turing Machines, with Examples (3.1)
Mon 27 Feb L14 Variants of Turing Machines (3.2)
Wed 29 Feb L15 Representing Algorithms as Turing Machines (3.3)
Fri 02 Mar L16 Decidable Languages (4.1)
Mon 05 Mar L17 The Halting Problem (4.2)
Wed 07 Mar L18 Proving Languages to be Undecidable (4.2)
Fri 09 Mar L19 Undecidable Problems in Formal Language Theory (5.1)
Mon 12 Mar L20 Post's Correspondence Problem (5.2)
Tue 13 Mar --- Last Day to Drop With W
Wed 14 Mar L21 Mapping Reducibility and More Undecidable Problems (5.3)
Fri 16 Mar L22 The Recursion Theorem (6.1)
SPRING BREAK
Mon 26 Mar L23 Review of Chapters 4 and 5
Wed 28 Mar L24 A Definition of Information (6.4)
Thu 29 Mar X02 SECOND MIDTERM (7-9 pm, 142 CMPSCI building) on Lectures 13-24
PART III: Complexity Theory
Fri 30 Mar --- NO CLASS (Makeup for second midterm)
Mon 02 Apr L25 Time Complexity (7.1)
Wed 04 Apr L26 The Class P (7.2)
Fri 06 Apr L27 The Class NP (7.3)
Mon 09 Apr L28 NP Completeness (7.4)
Wed 11 Apr L29 The Cook-Levin Theorem (7.4)
Fri 13 Apr L30 Some NP-Complete Problems (7.5)
Mon 16 Apr --- NO CLASS (Patriots' Day Holiday)
Tue 17 Apr L31 Space Complexity Definitions (8.1) (MONDAY SCHEDULE)
Wed 18 Apr L32 The Class PSPACE and Savitch's Theorem (8.1,8.2,8.3)
Fri 20 Apr L33 Logarithmic Space (8.4)
Mon 23 Apr L34 Reachability, L, NL, NL-Completeness (8.4)
Wed 25 Apr L35 Circuit Complexity (9.3)
Fri 27 Apr L36 The NC and AC Classes (9.3,10.5)
Mon 30 Apr L37 Course Review and Evaluations
Final Exam (cumulative) Monday 7 May, 10:30 a.m. - 12:30 p.m.
Last modified 22 March 2012