CS4123 Theory of Computation. B97
Schedule of Classes

Prof. Carolina Ruiz
Department of Computer Science
Worcester Polytechnic Institute


Date Due Topic Chapter
Th Aug 26   Introduction  
Fr Aug 27   Decidability vs. Undecidability  
Mo Aug 30   Turing Machines I 3.1
Tu Aug 31   Turing Machines II 3.1
Th Sep 02   Variants of Turing Machines 3.2
Fr Sep 03   Recursive Functions  
Tu Sep 07 HW I Church-Turing Thesis 3.3
Th Sep 09   Review  
Fr Sep 10   ** EXAM 1 **  
Mo Sep 13   Decidability I 4.1
Tu Sep 14   Decidability II 4.1
Th Sep 16   Decidability III 4.1
Fr Sep 17   Undecidability I 4.2
Mo Sep 20   Undecidability II 4.2
Tu Sep 21 HW II Reducibility 5.1
Th Sep 23   Many-to-one Reducibility, Turing Reducibility 5.3, 6.3
Fr Sep 24   ** EXAM 2 **  
Mo Sep 27   Time Complexity I 7.1
Tu Sep 28   Time Complexity II 7.1, 7.2
Th Sep 30   Class P 7.2
Fr Oct 01   Class NP - Polynomial Verifiability 7.3
Mo Oct 04   P vs. NP 7.3
Tu Oct 05 HW III NP-completeness - Reducibility 7.4
Th Oct 07   NP-completeness - Examples 7.4
Fr Oct 08   NP-completeness, Polynomial Hierarchy 7.5
Mo Oct 11 HW IV Coping with NP-completeness 10.1
Tu Oct 12   ** EXAM 3 **  
Th Oct 14   Final Remarks