Asymptotic density, computable traceability, and 1-randomness
Uri Andrews, Mingzhong Cai, David Diamondstone, Carl G. Jockusch, Steffen Lempp · Fundamenta Mathematicae · 2016
Let $r\in [0,1]$. A set $A \subseteq \omega $ is said to be coarsely computable at density $r$ if there is a computable function $f$ such that $\{n \mid f(n) = A(n)\}$ has lower density at least $r$. Our main results are that $A$ is coarsely comput