Asymptotic Density and Computably Enumerable Sets

Rodney G. Downey, Carl G. Jockusch, Paul E. Schupp

We study connections between classical asymptotic density and c.e. sets. We prove that a c.e. Turing degree d is not low if and only if d contains a c.e. set A of density 1 which h…