MATH 573

Spring 2006 Part of Term 1

Part of Term 1
Jan 17-May 3

Recursive Function Theory

Credit: 4 hours.

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.

My Favorites

My Schedule

Section Status updates every 10 minutes.

MATH 573 class schedule data for spring 2006
	CRN	Type	Section	Time	Day	Location	Instructor	Section Details
	43398	Lecture-Discussion	C1	10:00AM -10:50AM	MWF	Altgeld Hall	Van Den Dries, L	Part of Term: 1 Date Range: 01/17/06-05/03/06