Press Here to Create A Rating!
Press Here to Hide the Rating Form
Overview from eCalendar
- 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 2019
Instructors: There are no professors associated with this course for the 2018-2019 academic year.
- 3 hours
- Prerequisite: COMP 330