Graduate Bulletin 2011-2013 » Academic Programs and Courses » Mathematics and Computer Science » Courses in Computer Science » CMP 685: Computability Theory.
CMP 685: Computability Theory.
4 hours, 4 credits. Mathematical formulation of computability theory and abstract machine theory. Finite-state machines and Turing machines; Church's Thesis; recursive functions and recursively enumerable sets; unsolvability and the halting problem.
Last modified: 1/23/2013
