CMSC 38000
Computability Theory I (MATH 30200)Prerequisites: Math 25500 or consent of instructor
Catalog Description: We investigate recursive (such as computable) functions and sets generated by an algorithm (recursively enumerable sets). Topics include various mathematical models for computations, including Turing machines and Kleene schemata; enumeration and s-m-n theorems; and priority methods for the construction of recursively enumerable sets and degrees.
Instructors: R. SoareQuarter offered: Winter
Last Verified by Sharon Salveter on 8 April, 2003.