×

zbMATH — the first resource for mathematics

Strong jump-traceability and Demuth randomness. (English) Zbl 1303.03074
The major result in the paper under review is that a computably enumerable set is computable from a Demuth random set if and only if it is strongly jump-traceable. However, they also prove that there is a strongly jump-traceable computably enumerable set \(A\) so that no \(A\)-Demuth random set can compute \(A\).
Reviewer: Liang Yu (Nanjing)

MSC:
03D25 Recursively (computably) enumerable sets and degrees
03D32 Algorithmic randomness and dimension
03D28 Other Turing degree structures
PDF BibTeX XML Cite
Full Text: DOI arXiv