Enumerating randoms

Details Enumerating randoms Enumerating randoms

2010-08-28

arxiv.org/abs/1008.4825v1

Mathematics

Logic

Scientific paper

We investigate enumerability properties for classes of random reals which permit recursive approximations from below. For four classical notions of randomness (Martin-L\"of randomness, computable randomness, Schnorr randomness, and Kurtz randomness), as well as for bi-immunity, we detail whether the left-recursive enumerable members can be enumerated, and similarly for the complementary left-r.e. classes. We prove a general equivalence between arithmetic complexity and existence of numberings for classes of left-r.e. reals and give optimal arithmetic hardness results.

Affiliated with

Also associated with

No associations

Rating

Enumerating randoms 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 Enumerating randoms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Enumerating randoms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-529385