Abstract
The Turing degrees of Δ02 sets as well as the degrees of sets in certain upper segments of the Ershov hierarchy are characterized. In particular, it is shown that, up to Turing equivalence and admissible indexing, the noncomputable Δ02 sets are exactly the decision problems of countable partial orders of tree shape with branches of positive finite length only. © 2010 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Spreen, D. (2010). Every Δ02-set is natural, up to turing equivalence. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6158 LNCS, pp. 386–393). https://doi.org/10.1007/978-3-642-13962-8_43
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
