Visit for course dates & times.
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: Fall 2022
Instructors: Hatami, Hamed (Fall)
3 hours
Prerequisite: COMP 330
