CSCI0510(Formerly CS051 )
Models of Computation
|Meeting Time:||J: TTh 1:00-2:20|
|Exam Group:||10: 12/15/2015 at 2:00 P.M.|
|Offered This Year?||Yes|
|When Offered?||Every Year|
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 or CSCI 0450.