Switch to: References

Add citations

You must login to add citations.
  1. The Gamma question for many-one degrees.Matthew Harrison-Trainor - 2017 - Annals of Pure and Applied Logic 168 (7):1396-1405.
  • Computing from projections of random points.Noam Greenberg, Joseph S. Miller & André Nies - 2019 - Journal of Mathematical Logic 20 (1):1950014.
    We study the sets that are computable from both halves of some (Martin–Löf) random sequence, which we call 1/2-bases. We show that the collection of such sets forms an ideal in the Turing degrees that is generated by its c.e. elements. It is a proper subideal of the K-trivial sets. We characterize 1/2-bases as the sets computable from both halves of Chaitin’s Ω, and as the sets that obey the cost function c(x,s)=Ωs−Ωx−−−−−−−√. Generalizing these results yields a dense hierarchy of (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark