Undergraduate Bulletin 2011-2013 » Academic Departments and Programs » Mathematics and Computer Science » Courses in Computer Science (CMP) » CMP 416: Computability Theory.
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: 2/22/2013
