Asymptotic density and the coarse computability bound
Denis R. Hirschfeldt, Carl G. Jockusch, Timothy H. McNicholl, Paul E. Schupp · Computability · 2016
For r ∈ [ 0 , 1 ] we say that a set A ⊆ ω is coarsely computable at density r if there is a computable set C such that { n : C ( n ) = A ( n ) } has lower density at least r . Let γ ( A ) = sup { r : A is coarsely computable at density r } . We s