Schedule of Classes - D 2002

Date | Due | Topic |
Chapter
| ||

Tu | Mar 12 | Introduction | |||

Th | Mar 14 | Decidability vs. Undecidability | |||

Fr | Mar 15 | Turing Machines I | 3.1 | ||

Mo | Mar 18 | Turing Machines II | 3.1 | ||

Tu | Mar 19 | Variants of Turing Machines | 3.2 | ||

Th | Mar 21 | Recursive Functions | |||

Fr | Mar 22 | Church-Turing Thesis | 3.3 | ||

Mo | Mar 25 | Decidability I | 4.1 | ||

Tu | Mar 26 | HW1 | Decidability II | 4.1 | |

Th | Mar 28 | Review, catch up, and ** QUIZ I ** | |||

Fr | Mar 29 | Decidability III | 4.1 | ||

Mo | Apr 01 | Undecidability I | 4.2 | ||

Tu | Apr 02 | HW2 | Undecidability II | 4.2 | |

Th | Apr 04 | ** EXAM 1 ** | |||

Fr | Apr 05 | Reducibility | 5.1 | ||

Mo | Apr 08 | Many-to-one Reducibility, Turing Reducibility | 5.3, 6.3 | ||

Tu | Apr 09 | Time Complexity I | 7.1 | ||

Th | Apr 11 | Time Complexity II | 7.1, 7.2 | ||

Fr | Apr 12 | Class P | 7.2 | ||

Mo | Apr 15 | Class NP - Polynomial Verifiability | 7.3 | ||

Tu | Apr 16 | No class - Project presentation day | |||

Th | Apr 18 | HW3 | P vs. NP | 7.3 | |

Fr | Apr 19 | Review, catch up, and ** QUIZ II ** | |||

Mo | Apr 22 | NP-completeness - Reducibility | 7.4 | ||

Tu | Apr 23 | NP-completeness - Examples | 7.4 | ||

Th | Apr 25 | NP-completeness, Polynomial Hierarchy | 7.5 | ||

Fr | Apr 26 | HW4 | Coping with NP-completeness | 10.1 | |

Mo | Apr 29 | Catch up and Review | |||

Tu | Apr 30 | ** EXAM 2 ** |