We study effectively given positive reals (more specifically, computably enumerable reals) under a measure of relative randomness introduced by Solovay [manuscript, IBM Thomas J. Watson Research Center, Yorktown Heights, NY, 1975] and studied by Calude, Hertling, Khoussainov, and Wang [Theoret. Comput. Sci., 255 (2001), pp. 125--149], Calude [Theoret. Comput. Sci., 271 (2002), pp. 3--14], Kucera and Slaman [SIAM J. Comput., 31 (2002), pp. 199--211], and Downey, Hirschfeldt, and LaForte [Mathematical Foundations of Computer Science 2001, Springer-Verlag, Berlin, 2001, pp. 316--327], among others. This measure is called domination or Solovay reducibility and is defined by saying that $\alpha$ dominates $\beta$ if there are a constant c and a partial computable function $\varphi$ such that for all positive rationals $q<\alpha$ we have $\varphi(q)\!\downarrow<\beta$ and $\beta- \varphi(q) \leqslant c(\alpha- q)$. The intuition is that an approximating sequence for $\alpha$ generates one for $\beta$ whose rate of convergence is not much slower than that of the original sequence. It is not hard to show that if $\alpha$ dominates $\beta$, then the initial segment complexity of $\alpha$ is at least that of $\beta$.
In this paper we are concerned with structural properties of the degree structure generated by Solovay reducibility. We answer a natural question in this area of investigation by proving the density of the Solovay degrees. We also provide a new characterization of the random computably enumerable reals in terms of splittings in the Solovay degrees. Specifically, we show that the Solovay degrees of computably enumerable reals are dense, that any incomplete Solovay degree splits over any lesser degree, and that the join of any two incomplete Solovay degrees is incomplete, so that the complete Solovay degree does not split at all. The methodology is of some technical interest, since it includes a priority argument in which the injuries are themselves controlled by randomness considerations.
[1]
A. Kolmogorov.
Three approaches to the quantitative definition of information
,
1968
.
[2]
Ming Li,et al.
An Introduction to Kolmogorov Complexity and Its Applications
,
2019,
Texts in Computer Science.
[3]
Bakhadyr Khoussainov,et al.
Recursively enumerable reals and Chaitin Ω numbers
,
1998
.
[4]
G. Chaitin.
Incompleteness theorems for random reals
,
1987
.
[5]
Ker-I Ko,et al.
On the Continued Fraction Representation of Computable Real Numbers
,
1986,
Theor. Comput. Sci..
[6]
Klaus Weihrauch,et al.
Weakly Computable Real Numbers
,
2000,
J. Complex..
[7]
Cristian S. Calude,et al.
Degree-Theoretic Aspects of Computably Enumerable Reals
,
1998
.
[8]
N. Costa,et al.
Non-Classical Logics, Model Theory and Computability
,
1980
.
[9]
Chun-Kuen Ho,et al.
Relatively Recursive Reals and Real Functions
,
1994,
Theor. Comput. Sci..
[10]
Cristian S. Calude.
Information and Randomness: An Algorithmic Perspective
,
1994
.
[11]
Per Martin-Löf,et al.
The Definition of Random Sequences
,
1966,
Inf. Control..
[12]
Claus-Peter Schnorr,et al.
The process complexity and effective random tests.
,
1972,
STOC.
[13]
Robert I. Soare,et al.
Cohesive sets and recursively enumerable Dedekind cuts
,
1969
.
[14]
R. Soare.
Recursively enumerable sets and degrees
,
1987
.
[15]
Gregory J. Chaitin,et al.
A recent technical report
,
1974,
SIGA.
[16]
Cristian S. Calude,et al.
Chaitin Numbers and Strong Reducibilities
,
1997
.
[17]
Cristian S. Calude.
Information and Randomness
,
1994,
Monographs in Theoretical Computer Science An EATCS Series.
[18]
Rod Downey.
COMPUTABILITY, DEFINABILITY AND ALGEBRAIC STRUCTURES
,
2003
.
[19]
Antonín Kucera,et al.
Randomness and Recursive Enumerability
,
2001,
SIAM J. Comput..
[20]
Alistair H. Lachlan,et al.
Recursive real numbers
,
1963,
Journal of Symbolic Logic.
[21]
Cristian S. Calude.
A characterization of c.e. random reals
,
2002,
Theor. Comput. Sci..