Note: This is the 2018–2019 eCalendar. Update the year in your browser's URL bar for the most recent version of this page, or jump to the newest eCalendar.
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: This course is not scheduled for the 2018-2019 academic year.
Instructors: There are no professors associated with this course for the 2018-2019 academic year.
3 hours
Prerequisite: COMP 330
