CSCI0510

Models of Computation

Summer 2018

THIS COURSE IS NOW BEING OFFERED AS CSCI 1010 AS OF FALL 2016

This course introduces basic models of computation including languages, finite-state automata and Turing machines. Proves fundamental limits on computation (incomputability, the halting problem). Provides the tools to compare the hardness of computational problems (reductions). Introduces computational complexity classes (P, NP, PSPACE and others). Prerequisite: CSC0220.

THIS COURSE IS NOW BEING OFFERED AS CSCI 1010.