Abstract:
We study computably enumerable reals (i.e. their left cut is computably
enumerable) in terms of their spectra of representations and presentations. Then we study
such objects in terms of algorithmic randomness, culminating in some recent work of the
author with Hirschfeldt, Laforte, and Nies concerning methods of calibrating randomness.