CMP 416 Computability Theory

Mathematical formulation of computability theory and abstract machine theory. Finite-state machines and Turing machines; Church-Turing Thesis; recursive functions and recursively enumerable sets; unsolvability and the Halting Problem. 

Credits:

4

Hours

4

Requirement Designation

Regular Liberal Arts

Offered

Fall-Spring

Prerequisite

CMP 232 and CMP 326.