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 with a minimum grade of C-.
Mo 10:30 AM – 12:20 PM
We 10:30 AM – 11:20 AM
BLU 10011, Burnaby
WMC 3210, Burnaby