Sciweavers

COMPUTABILITY
2016
61views more  COMPUTABILITY 2016»
10 years 21 days ago
Asymptotic density and the coarse computability bound
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) =...
Denis R. Hirschfeldt, Carl G. Jockusch Jr., Timoth...