Visit for course dates & times.
Nota : Ceci est la version 2021鈥�2022 de l'annuaire 茅lectronique. Veuillez mettre 脿 jour l'ann茅e dans la barre d'adresse de votre navigateur pour une version plus r茅cente de cette page, ou .
Vue d'ensemble
Informatique (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: Automne 2021
Instructors: Hatami, Hamed (Fall)
3 hours
Prerequisite: COMP 330
