WPI Worcester Polytechnic Institute

Computer Science Department
------------------------------------------

CS4123 Theory of Computation 
Schedule of Classes - B 2004

PROF. CAROLINA RUIZ 

WARNING: Small changes to this schedule may be made during the course of the term. 
------------------------------------------

Date Due Topic Chapter
Tu Oct 26   Introduction  
Th Oct 28   Decidability vs. Undecidability  
Fr Oct 29   Turing Machines I 3.1
Mo Nov 01   Turing Machines II 3.1
Tu Nov 02   Variants of Turing Machines 3.2
Th Nov 04   Recursive Functions  
Fr Nov 05 HW1 Church-Turing Thesis 3.3
Mo Nov 08   Decidability I 4.1
Tu Nov 09   Decidability II 4.1
Th Nov 11   Review, catch up, and ** QUIZ I **  
Fr Nov 12   Decidability III 4.1
Mo Nov 15   Undecidability I 4.2
Tu Nov 16 HW2 Undecidability II 4.2
Th Nov 18   Catch up and Review  
Fr Nov 19   ** EXAM 1 **  
Mo Nov 22   Reducibility 5.1
Tu Nov 23   Many-to-one Reducibility, Turing Reducibility 5.3, 6.3
Th Nov 25   No class - Thanksgiving Break  
Fr Nov 26   No class - Thanksgiving Break  
Mo Nov 29   More on reducibility 5.1, 5.3, 6.3
Tu Nov 30   Time Complexity I 7.1, 7.2
Th Dec 02   Time Complexity II, Class P 7.2
Fr Dec 03 HW3 Class NP - Polynomial Verifiability, NP vs NP 7.3
Mo Dec 06   NP-completeness - Reducibility 7.4
Tu Dec 07   Review, catch up, and ** QUIZ II **  
Th Dec 09   NP-completeness - Examples 7.4
Fr Dec 10   NP-completeness, Polynomial Hierarchy 7.5
Mo Dec 13   Coping with NP-completeness 10.1
Tu Dec 14 HW4 Catch up and Review  
Th Dec 16   ** EXAM 2 **