CS 454 - Theory of Computation

Unit(s): 4 Lecture: 4 hours

Overview of various kinds of computability, unsolvability, and decidability. The P versus NP problem. Abstract mathematical models of computing devices and language specification systems with focus on regular and context-free languages. Classification of computer-solvable problems.

Prerequisite(s): Grade of Cor better in CS 315, or consent of instructor.
Typically Offered Fall & Spring
Grading: GRD