A random set which only computes strongly jump-traceable C.e. Sets

Journal of Symbolic Logic 76 (2):700 - 718 (2011)
  Copy   BIBTEX

Abstract

We prove that there is a ${\mathrm{\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 ω-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 ω-c.e. random sets

Other Versions

No versions found

Similar books and articles

Analytics

Added to PP
2013-09-30

Downloads
170 (#241,897)

6 months
28 (#330,258)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Demuth randomness and computational complexity.Antonín Kučera & André Nies - 2011 - Annals of Pure and Applied Logic 162 (7):504-513.
Computably enumerable sets below random sets.André Nies - 2012 - Annals of Pure and Applied Logic 163 (11):1596-1610.
Characterising Sjt Reducibility.Noam Greenberg, André Nies & Daniel Turetsky - forthcoming - Journal of Symbolic Logic:1-23.

Add more citations

References found in this work

Randomness and computability: Open questions.Joseph S. Miller & André Nies - 2006 - Bulletin of Symbolic Logic 12 (3):390-410.
Lowness properties and approximations of the jump.Santiago Figueira, André Nies & Frank Stephan - 2008 - Annals of Pure and Applied Logic 152 (1):51-66.
Benign cost functions and lowness properties.Noam Greenberg & André Nies - 2011 - Journal of Symbolic Logic 76 (1):289 - 312.
Promptness Does Not Imply Superlow Cuppability.David Diamondstone - 2009 - Journal of Symbolic Logic 74 (4):1264-1272.

Add more references