COMP 531 Advanced Theory of Computation (3 credits)

Offered by: Computer Science (Faculty of Science)


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 2017

Instructors: Denis Therien (Winter)