MATH 162 Introduction to Computably Enumerable Functions and Sets and their Degrees

Topics include computable functions; Church's thesis; Halting problem; computable and computably enumerable (c.e.) functions and sets; relative computability; Turing-degrees and the jump operator; Arithmetical hierarchy; oracle constructions; Post's problem; and finite injury priority method, and splitting theorems for c.e. degrees.