arXiv Analytics

Sign in

arXiv:1109.6128 [math.LO]AbstractReferencesReviewsResources

Strong jump traceability and Demuth randomness

Noam Greenberg, Daniel Turetsky

Published 2011-09-28Version 1

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.

Comments: 28 pages
Categories: math.LO
Related articles: Most relevant | Search more
arXiv:1111.4339 [math.LO] (Published 2011-11-18, updated 2013-11-27)
Kolmogorov complexity and computably enumerable sets
arXiv:1403.5721 [math.LO] (Published 2014-03-23)
Logic Blog 2011
arXiv:math/0606728 [math.LO] (Published 2006-06-28)
The finite intervals of the Muchnik lattice

Links

Toolbox