Strong jump traceability and Demuth randomness

Details Strong jump traceability and Demuth randomness Strong jump traceability and Demuth randomness

2011-09-28

arxiv.org/abs/1109.6128v1

Mathematics

Logic

28 pages

Scientific paper

We solve the covering problem for Demuth randomness, showing that a
computably enumerable set is computable from a Demuth random set if and only if
it is strongly jump-traceable. We show that on the other hand, the class of
sets which form a base for Demuth randomness is a proper subclass of the class
of strongly jump-traceable sets.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-43197