Please note:
To view the Fall 2025 Academic Calendar, go to www.sfu.ca/students/calendar/2025/fall.html.
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 |
|---|---|---|---|
|
Evgenia Ternovska |
Jan 5 – Apr 10, 2026: Tue, 1:30–2:20 p.m.
Jan 5 – Apr 10, 2026: Thu, 12:30–2:20 p.m. |
Burnaby Burnaby |