MATH 573

fall 2004
 
All Classes
Recursive Function Theory

Credit: 4 hours.

(MATH 412) Various characterizations of the class of recursive (i.e., computable) functions; the Church-Turing thesis; unsolvability of the halting problem; the recursion theorem and the enumeration theorem; relative computability, the jump operation, and the arithmetical hierarchy; recursively enumerable sets; degrees of unsolvability; and the priority method. Prerequisite: MATH 570 or consent of instructor.

Closed
Section Status Closed
Open
Section Status Open
Pending
Section Status Pending
Open (Restricted)
Section Status Open (Restricted)
Unknown
Section Status Unknown
Section Status updates every 10 minutes.
Detail Status CRN Type Section Time Day Location Instructor