Syllabus
Simple sets.
Relative computability, T-reducibility.
Jump operation, basic properties. Limit computability.
Arithmetical hierarchy, basic properties. Applications of the theory of computability.
Annotation
A continuation of Computability I.
Various types of computably enumerable sets. A connection to mathematical logic. Relative computability. Jump operation. Arithmetical hierarchy.