MATH 573

Fall 2014 Part of Term 1

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.

MATH 573 class schedule data for fall 2014
CRN Type Section Time Day Location Instructor Section Details
39218
Lecture-Discussion
X1
12:00PM -12:50PM
MWF
Altgeld Hall
Solecki, S
Part of Term:
1
Date Range:
08/25/14-12/10/14
Section Info:
Undergraduate students may register with approval. For more information go to room 313 AH. Students from the following programs must contact the Director of Graduate Studies in Mathematics <Laugesen@illinois.edu> to request permission to register for the course: MS:Economics:Policy Econ -UIUC or MS: Financial Engineering.
Restriction(s):
Restricted to Graduate - Urbana-Champaign. Not intended for MS:Economics:Policy Econ -UIUC or MS: Financial Engineering.
COURSE EXPLORER
Email: Course Explorer Feedback

OFFICE OF THE REGISTRAR | 901 W. Illinois Street, Urbana, Illinois 61801

Site developed by: Technology Services at Illinois | UNIVERSITY OF ILLINOIS URBANA-CHAMPAIGN
1102 Digital Computer Laboratory | MC-256 | Urbana, IL 61801 | phone 217-244-7000