MATH 573
Fall 2004 All Classes
All Classes
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.
Section Status updates every 10 minutes.
| CRN | Type | Section | Time | Day | Location | Instructor | Section Details | |
|---|---|---|---|---|---|---|---|---|
|
39218
|
Lecture-Discussion
|
G1
|
3:00PM
-3:50PM
|
MWF
|
441 Altgeld Hall
|
Pillay, A
|
|