Random semicomputable reals revisited

Details Random semicomputable reals revisited Random semicomputable reals revisited

2011-10-23

arxiv.org/abs/1110.5028v1

Mathematics

Logic

15 pages

Scientific paper

The aim of this expository paper is to present a nice series of results, obtained in the papers of Chaitin (1976), Solovay (1975), Calude et al. (1998), Kucera and Slaman (2001). This joint effort led to a full characterization of lower semicomputable random reals, both as those that can be expressed as a "Chaitin Omega" and those that are maximal for the Solovay reducibility. The original proofs were somewhat involved; in this paper, we present these results in an elementary way, in particular requiring only basic knowledge of algorithmic randomness. We add also several simple observations relating lower semicomputable random reals and busy beaver functions.

Affiliated with

Also associated with

No associations

Rating

Random semicomputable reals revisited does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Random semicomputable reals revisited, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Random semicomputable reals revisited will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-526710