Journal of Symbolic Logic

Relative randomness and real closed fields

Alexander Raichev

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text


We show that for any real number, the class of real numbers less random than it, in the sense of rK-reducibility, forms a countable real closed subfield of the real ordered field. This generalizes the well-known fact that the computable reals form a real closed field.

With the same technique we show that the class of differences of computably enumerable reals (d.c.e. reals) and the class of computably approximable reals (c.a. reals) form real closed fields. The d.c.e. result was also proved nearly simultaneously and independently by Ng (Keng Meng Ng, Master's Thesis, National University of Singapore, in preparation).

Lastly, we show that the class of d.c.e. reals is properly contained in the class or reals less random than ω (the halting probability), which in turn is properly contained in the class of c.a. reals, and that neither the first nor last class is a randomness class (as captured by rK-reducibility).

Article information

J. Symbolic Logic, Volume 70, Issue 1 (2005), 319-330.

First available in Project Euclid: 1 February 2005

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier

Primary: 03D80: Applications of computability and recursion theory 68Q30: Algorithmic information theory (Kolmogorov complexity, etc.) [See also 03D32]

relative randomness real closed field rK-reducibility d.c.e. real c.a. real


Raichev, Alexander. Relative randomness and real closed fields. J. Symbolic Logic 70 (2005), no. 1, 319--330. doi:10.2178/jsl/1107298522.

Export citation


  • Klaus Ambos-Spies, Klaus Weihrauch, and Xizhong Zheng Weakly computable real numbers, Journal of Complexity, vol. 16 (2000), no. 4, pp. 676--690.
  • Rod G. Downey, Denis R. Hirschfeldt, and Geoff LaForte Randomness and reducibility, Journal of Computer and System Sciences, vol. 68 (2004), no. 1, pp. 96--114.
  • Chun-Kuen Ho Relatively recursive reals and real functions, Theoretical Computer Science, vol. 210 (1999), no. 1, pp. 99--120.
  • Steffen Lempp Priority arguments in computability theory, model theory, and complexity theory, manuscript, available at
  • Ming Li and Paul Vitányi An introduction to Kolmogorov complexity and its applications, second ed., Graduate Texts in Computer Science, Springer-Verlag, New York,1997.
  • David Marker Model theory, Graduate Texts in Mathematics, vol. 217, Springer-Verlag, New York,2002.
  • Keng Meng Ng Master's thesis, National University of Singapore, In preparation.
  • Marian B. Pour-El and J. Ian Richards Computability in analysis and physics, Perspectives in Mathematical Logic, Springer-Verlag, Berlin,1989.
  • Walter Rudin Principles of mathematical analysis, third ed., McGraw-Hill Book Co., New York,1976, International Series in Pure and Applied Mathematics.
  • Xizhong Zheng and Klaus Weihrauch The arithmetical hierarchy of real numbers, Mathematical Logic Quarterly, vol. 47 (2001), no. 1, pp. 51--65.