A RANDOM SET WHICH ONLY COMPUTES STRONGLY JUMP-TRACEABLE CE SETS

作者:Greenberg Noam*
来源:Journal of Symbolic Logic, 2011, 76(2): 700-718.
DOI:10.2178/jsl/1305810771

摘要

We prove that there is a Delta(0)(2), 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.

  • 出版日期2011-6