A c.e. real x is Solovay reducible to another c.e. real y if x can be approximated at least as efficiently as y by means of increasing computable sequences of rational numbers. The Solovay reducibility classifies elegantly the relative randomness of c.e. reals. Especially, the c.e. random reals are complete unter the Solovay reducibility for c.e. reals. In this paper we investigate an extension of the Solovay reducibility to the Δ 20-reals and show that the c.e. random reals are complete under (extended) Solovay reducibility for d-c.e. reals too. Actually we show that only the d-c.e. reals can be Solovay reducible to an c.e. random real. Furthermore, we show that this fails for the class of divergence bounded computable reals which extends the class of d-c.e. reals properly. In addition, we show also that any d-c.e. random reals are either c.e. or co-c.e. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Rettinger, R., & Zheng, X. (2005). Solovay reducibility on D-c.e real numbers. In Lecture Notes in Computer Science (Vol. 3595, pp. 359–368). Springer Verlag. https://doi.org/10.1007/11533719_37
Mendeley helps you to discover research relevant for your work.