MATH 573

Spring 2008 All Classes

All Classes

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 2008
	CRN	Type	Section	Time	Day	Location	Instructor	Section Details
	43398	Lecture-Discussion	M1	9:00AM -10:20AM	TR	345 Altgeld Hall	Rosendal, C	Part of Term: 1 Date Range: 01/14/08-04/30/08 Restriction(s): Not intended for Undergrad - Urbana-Champaign.