On the turing degrees of divergence bounded computable reals

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The d-c.e. (difference of c.e.) and dbc (divergence bounded computable) reals are two important subclasses of Δ20-reals which have very interesting computability-theoretical as well as very nice analytical properties. Recently, Downey, Wu and Zheng [2] have shown by a double witness technique that not every Δ20-Turing degree contains a d-c.e. real. In this paper we show that the classes of Turing degrees of d-c.e., dbc and Δ20 reals are all different. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Rettinger, R., & Zheng, X. (2005). On the turing degrees of divergence bounded computable reals. In Lecture Notes in Computer Science (Vol. 3526, pp. 418–428). Springer Verlag. https://doi.org/10.1007/11494645_51

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free