MATH 573
Fall 2014 Part of Term 1
Aug 25-Dec 10
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.
| CRN | Type | Section | Time | Day | Location | Instructor | Section Details | |
|---|---|---|---|---|---|---|---|---|
|
39218
|
Lecture-Discussion
|
X1
|
12:00PM
-12:50PM
|
MWF
|
Altgeld Hall
|
Solecki, S
|
|