(Formerly CSCI0510)

Theory of Computation

Course Home Page:
Meeting Time:I hr: T, Th 10:30-11:50
Semester:1 (Fall)
Offered this year?Yes
When Offered?Every year


The 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: CSCI 0220 or 1450.

CRN: 16069