Other measures of relative randomness
Peter Cholak · 2005
Before we leave the Solovay degrees of c.e. reals, we note that the structure must be very complicated. The proof of Theorem 33 uses Nies’s method of interpreting effectively dense Boolean algebras, together with a technical construction of a certain class of (strongly) c.e. reals. Calude and Nies [9] have proven that the random reals are all ^//-complete. Very little else is known about the Solovay degrees of c.e. reals.