The aim of this expository paper is to present a nice series of results, obtained in the papers of Chaitin [3], Solovay [8], Calude et al. [2], Ku era and Slaman [5]. This joint effort led to a full characterization of lower semicomputable random reals, both as those that can be expressed as a "Chaitin Omega" and those that are maximal for the Solovay reducibility. The original proofs were somewhat involved; in this paper, we present these results in an elementary way, in particular requiring only basic knowledge of algorithmic randomness. We add also several simple observations relating lower semicomputable random reals and busy beaver functions. © 2012 Springer-Verlag.
CITATION STYLE
Bienvenu, L., & Shen, A. (2012). Random semicomputable reals revisited. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7160 LNCS, pp. 31–45). https://doi.org/10.1007/978-3-642-27654-5_3
Mendeley helps you to discover research relevant for your work.