Switch to: References

Add citations

You must login to add citations.
  1. Asymptotic Density and Computably Enumerable Sets.Rodney G. Downey, Carl G. Jockusch & Paul E. Schupp - 2013 - Journal of Mathematical Logic 13 (2):1350005.
    We study connections between classical asymptotic density, computability and computable enumerability. In an earlier paper, the second two authors proved that there is a computably enumerable set A of density 1 with no computable subset of density 1. In the current paper, we extend this result in three different ways: The degrees of such sets A are precisely the nonlow c.e. degrees. There is a c.e. set A of density 1 with no computable subset of nonzero density. There is a (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  • The Computational Content of Intrinsic Density.Eric P. Astor - 2018 - Journal of Symbolic Logic 83 (2):817-828.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Coarse Reducibility and Algorithmic Randomness.Denis R. Hirschfeldt, Carl G. Jockusch, Rutger Kuyper & Paul E. Schupp - 2016 - Journal of Symbolic Logic 81 (3):1028-1046.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations