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.
Trimestres : Hiver 2016
Charg茅s de cours : Therien, Denis (Winter)
3 hours
Prerequisite: COMP 330