1. Andrews, U., Cai, M., Diamondstone, D., Jockusch, C., Lempp, S.: Asymptotic density, computable traceability, and
$$1$$
-randomness. Fundam. Math. 234, 41–53 (2016)
2. Astor, E., Hirschfeldt, D., Jockusch, C.: Dense computability, upper cones and minimal pairs. In preparation
3. Barzdin, J.: On a frequency solution to the problem of occurrence in a recursively enumerable set. Proc. Steklov Inst. Math. 133, 49–56 (1973)
4. Bienvenu, L., Day, A., Hölzl, R.: From bi-immunity to absolute undecidability. J. Symb. Log. 78(4), 1218–1228 (2013)
5. Cholak, P., Igusa, G.: Bounding a density-
$$1$$
and quasiminimality in the generic degrees. Preprint