Please note:

To view the current Academic Calendar, go to

Computability and Complexity CMPT 308 (3)

Formal models of computation such as automata and Turing machines. Decidability and undecidability. Recursion Theorem. Connections between computability and logic (Gödel’s Incompleteness). Time and space complexity classes. NP-completeness. Prerequisite: (MACM 201 or CMPT 210) with a minimum grade of C-.

Section Instructor Day/Time Location
D100 Valentine Kabanets
Sep 6 – Dec 5, 2023: Wed, 1:30–2:20 p.m.
Sep 6 – Dec 5, 2023: Fri, 12:30–2:20 p.m.