Enabling javascript will improve the functionality of this page. skip to content
Lehman College

Catalog search


Catalog links

print page

CMP 416: Computability Theory.

4 hours, 4 credits. 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. PREREQ: CMP 232 and CMP 326.

Last modified: 3/11/2014