Skip to content. Skip to navigation
McGill Home SOCS Home
Personal tools
You are here: Home Academic Courses Course Profile

COMP- 531: THEORY OF COMPUTATION

Course Summary

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.


McGill Course Description (Click Here)


Winter 2014

McGill Course Calendar Details

Instructor:

  • Denis Thérien
        Phone: 398-7073
        E-mail: denis AT cs DOT mcgill DOT ca
        Office Hours: TBA

TA: