Strong jump traceability and Demuth randomness
Logic
2011-09-29 v1
Abstract
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.
Keywords
Cite
@article{arxiv.1109.6128,
title = {Strong jump traceability and Demuth randomness},
author = {Noam Greenberg and Daniel Turetsky},
journal= {arXiv preprint arXiv:1109.6128},
year = {2011}
}
Comments
28 pages