Schedule of Classes - B 2002

Date | Due | Topic |
Chapter
| ||

Tu | Oct 22 | Introduction | |||

Th | Oct 24 | Decidability vs. Undecidability | |||

Fr | Oct 25 | Turing Machines I | 3.1 | ||

Mo | Oct 28 | Turing Machines II | 3.1 | ||

Tu | Oct 29 | Variants of Turing Machines | 3.2 | ||

Th | Oct 31 | Recursive Functions | |||

Fr | Nov 01 | HW1 | Church-Turing Thesis | 3.3 | |

Mo | Nov 04 | Decidability I | 4.1 | ||

Tu | Nov 05 | Decidability II | 4.1 | ||

Th | Nov 07 | Review, catch up, and ** QUIZ I ** | |||

Fr | Nov 08 | Decidability III | 4.1 | ||

Mo | Nov 11 | HW2 | Undecidability I | 4.2 | |

Tu | Nov 12 | Undecidability II | 4.2 | ||

Th | Nov 14 | Catch up and Review | |||

Fr | Nov 15 | ** EXAM 1 ** | |||

Mo | Nov 18 | Reducibility | 5.1 | ||

Tu | Nov 19 | Many-to-one Reducibility, Turing Reducibility | 5.3, 6.3 | ||

Th | Nov 21 | HW3 | Time Complexity I | 7.1 | |

Fr | Nov 22 | Time Complexity II | 7.1, 7.2 | ||

Mo | Nov 25 | Class P | 7.2 | ||

Tu | Nov 26 | Review, catch up, and ** QUIZ II ** | |||

Th | Nov 28 | No class - Thanksgiving Break | |||

Fr | Nov 29 | No class - Thanksgiving Break | |||

Mo | Dec 02 | Class NP - Polynomial Verifiability, NP vs NP | 7.3 | ||

Tu | Dec 03 | NP-completeness - Reducibility | 7.4 | ||

Th | Dec 05 | NP-completeness - Examples | 7.4 | ||

Fr | Dec 06 | HW4 | NP-completeness, Polynomial Hierarchy | 7.5 | |

Mo | Dec 09 | Coping with NP-completeness | 10.1 | ||

Tu | Dec 10 | Catch up and Review | |||

Th | Dec 12 | ** EXAM 2 ** |