Computability Learning Seminar

Michael Deveau, Department of Pure Mathematics, University of Waterloo

"Generalizing $\omega^k$-c.e. for Relativization"

Just as the arithmetic hierarchy characterizes reductions below various Turing jumps of $\emptyset$, Anderson and Csima showed that the Ershov hierarchy -- related to the notion of $\omega^k$-c.e. -- characterizes reductions of bounded Turing jumps of $\emptyset$. We discuss how to relativize this to reductions below bounded Turing jumps of an arbitrary set.

MC 5413