Reals, computable or otherwise
Peter Cholak · 2005
Our main goal is to look at algorithmic randomness, especially with respect to computably enumerable reals. To this end we will next introduce the basic approaches to the study of algorithmic randomness, both topological notions, as in Martin-Lof randomness, and compressibility notions such as ChaitinKolmogorov randomness. We begin by looking at these notions for finite strings and then proceed to reals.