For a pseudojump operator Vx and a ∏ 10 class P, we consider properties of the set {Vx : X ∈P}. We show that there always exists X ∈P with Vx ≤T 0′ and that if P is Medvedev complete, then there exists X ∈P with Vx le;T 0′. We examine the consequences when Vx is Turing incomparable with VY for X ne; Y in P and when W eX = WWeY for all X, Y ∈ P. Finally, we give a characterization of the jump in terms of ∏ 10 classes. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Cenzer, D., LaForte, G., & Wu, G. (2007). Pseudojump operators and ∏10 classes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4497 LNCS, pp. 146–151). https://doi.org/10.1007/978-3-540-73001-9_15
Mendeley helps you to discover research relevant for your work.