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 2010
Instructors: Nguyen, The Phuong (Winter)
- 3 hours
- Prerequisite: COMP 330