everything.study
MATH 227A

Theory of Recursive Functions

4 credits · Graduate

Recursive and recursively enumerable sets of natural numbers; characterizations, significance, and classification. Relativization, degrees of unsolvability. The recursion theorem. Constructive ordinals, the hyperarithmetical and analytical hierarchies. Recursive objects of higher type. Sequence begins fall.

Prerequisites & course information

{'preRequisiteCourse': '1145971', 'concurrentPrerequisit': False}

Sources