Greenberg, Noam A random set which only computes strongly jump-traceable c.e. sets. (English) Zbl 1220.03042 J. Symb. Log. 76, No. 2, 700-718 (2011). Summary: We prove that there is a \(\Delta_2^0\), 1-random set \(Y\) such that every computably enumerable set which is computable from \(Y\) is strongly jump-traceable.We also show that for every order function \(h\) there is an \(\omega \)-c.e. random set \(Y\) such that every computably enumerable set which is computable from \(Y\) is \(h\)-jump-traceable. This establishes a correspondence between rates of jump-traceability and computability from \(\omega \)-c.e. random sets. Cited in 3 Documents MSC: 03D32 Algorithmic randomness and dimension 03D25 Recursively (computably) enumerable sets and degrees Keywords:random set; computably enumerable set; jump-traceability; computability PDF BibTeX XML Cite \textit{N. Greenberg}, J. Symb. Log. 76, No. 2, 700--718 (2011; Zbl 1220.03042) Full Text: DOI References: [1] DOI: 10.2178/bsl/1154698740 · Zbl 1169.03033 [2] DOI: 10.1007/BFb0016275 [3] DOI: 10.1112/jlms/jdm041 · Zbl 1128.03036 [4] DOI: 10.1016/j.aim.2004.10.006 · Zbl 1141.03017 [5] DOI: 10.1016/j.apal.2007.11.002 · Zbl 1137.03025 [6] Promptness does not imply superlow cuppability 74 pp 1264– (2009) · Zbl 1197.03044 [7] DOI: 10.1016/j.aim.2007.09.008 · Zbl 1134.03026 [8] Benign cost functions and lowness properties 76 pp 289– (2011) · Zbl 1221.03036 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.