CS 5060 - Computation Theory

Explores fundamentals concerning formal language theory and the theory of computation. Topics include basic models of computation, the Church-Turing thesis, Turing machines, decidability and undecidability, computational complexity, NP-completeness, and diagonalization.

Requisites

Credit Hours: 3.0
Repeat/Retake Information: May not be retaken.

Lecture/Lab Hours: 3.0 lecture

Eligible grades: A-F,WP,WF,FN,FS,AU,I