Ï㽶ÊÓƵ

COMP 531 Advanced Theory of Computation (3 credits)

important

Note: This is the 2017–2018 eCalendar. Update the year in your browser's URL bar for the most recent version of this page, or .

Offered by: Computer Science (Faculty of Science)

Overview

Computer Science (Sci) : Models for sequential and parallel computations: Turing machines, boolean circuits. The equivalence of various models and the Church-Turing thesis. Unsolvable problems. Model dependent measures of computational complexity. Abstract complexity theory. Exponentially and super-exponentially difficult problems. Complete problems.

Terms: Winter 2018

Instructors: Therien, Denis (Winter)

Back to top