(Formerly CSCI0510)

Theory of Computation

Offered this year and every year

Fall 2023

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: CSCI0220 or CSCI1450 or CSCI1550 or APMA1650/1655 or CSCI1570

Course Home Page:
Location:CIT 368
Meeting Time:TTh 10:30am-11:50am
Exam Group:13