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 LGRC (the low-rise) room 201. There are two evening midterm exams, on Mondays -- the regular classes those days are cancelled.
PART I: Automata and Formal Languages Wed 20 Jan L01 Course Overview (0.1) Fri 22 Jan L02 Basic Definitions (0.2) Mon 25 Jan L03 Review of Proof Techniques (0.3,0.4) Wed 27 Jan L04 Deterministic Finite Automata (1.1) Fri 29 Jan L05 Nondeterministic Finite Automata (1.2) Mon 01 Feb L06 Regular Expressions and Kleene's Theorem (1.3) Wed 03 Feb L07 Proof of Kleene's Theorem (1.3) Fri 05 Feb L08 Non-Regular Languages (1.4) Mon 08 Feb L09 The Myhill-Nerode Theorem (1.4 plus) (DAVE AWAY) Wed 10 Feb L10 NO CLASS (Alleged Snow) Fri 12 Feb L11 Context-Free Languages and Grammars (2.1) (DAVE AWAY) Mon 15 Feb --- NO CLASS (Presidents' Day) Tue 16 Feb L12 PDA's, Equivalence of CFL's and PDA's (2.2) (MONDAY SCHEDULE) Wed 17 Feb L13 Non-Context-Free Languages, More Equivalence (2.3) Fri 19 Feb L14 Properties of the Context-Free Languages (2.3) Mon 22 Feb X01 FIRST MIDTERM (7-9 pm, A201 LGRC) on Lectures 1-14 (no lecture) PART II: Turing Machines and Computability Wed 24 Feb L15 NO CLASS (Real Snow, Slush, Downed Trees, etc.) Fri 26 Feb L16 Turing Machines, with Examples (3.1) Mon 01 Mar L17 Variants of Turing Machines (3.2) Wed 03 Mar L18 Representing Algorithms as Turing Machines (3.3) Fri 05 Mar L19 Decidable Languages (4.1) Mon 08 Mar L20 The Halting Problem (4.2) Wed 10 Mar L21 Proving Languages to be Undecidable (4.2) Fri 12 Mar L22 Undecidable Problems in Formal Language Theory (5.1) SPRING BREAK Mon 22 Mar L23 Post's Correspondence Problem (5.2) Wed 24 Mar L24 Mapping Reducibility and More Undecidable Problems (5.3) Fri 26 Mar L25 The Recursion Theorem (6.1) Mon 29 Mar X02 SECOND MIDTERM (7-9 pm, A201 LGRC) on Lectures 15-25 (no lecture) Wed 31 Mar L26 A Definition of Information (6.4) PART III: Complexity Theory Fri 02 Apr L27 Time Complexity (7.1) Mon 05 Apr L28 The Class P (7.2) Wed 07 Apr L29 The Class NP (7.3) Fri 09 Apr L30 NP Completeness (7.4) Mon 12 Apr L31 The Cook-Levin Theorem (7.4) Wed 14 Apr L32 Some NP-Complete Problems (7.5) Fri 16 Apr L33 Space Complexity Definitions (8.1) Mon 19 Apr --- NO CLASS (Patriots' Day) Wed 21 Apr L34 The Class PSPACE and Savitch's Theorem (8.1,8.2,8.3) (MONDAY SCHEDULE) Fri 23 Apr L35 Logarithmic Space (8.4) Mon 26 Apr L36 Reachability, L, NL, NL-Completeness (8.4) Wed 28 Apr L37 Circuit Complexity (9.3) Fri 30 Apr L38 The NC and AC Classes (9.3,10.5) Mon 03 May L39 Course Review and Evaluations Final Exam (cumulative) Tuesday 11 May 2010, 1:30-3:30 p.m., room 142 CMPSCI BuildingLast modified 19 March 2010