Skip to Main content Skip to Navigation
Conference papers

Random Semicomputable Reals Revisited

Abstract : The aim of this expository paper is to present a nice series of results, obtained in the papers of Chaitin (1976), Solovay (1975), Calude et al. (1998), Kucera and Slaman (2001). 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.
Complete list of metadatas

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00845796
Contributor : Andrei Romashchenko <>
Submitted on : Wednesday, July 17, 2013 - 5:49:22 PM
Last modification on : Friday, March 27, 2020 - 2:56:21 AM

Links full text

Identifiers

Citation

Laurent Bienvenu, Alexander Shen. Random Semicomputable Reals Revisited. WTCS: Workshop on Theoretical Computer Science, Feb 2012, Auckland, New Zealand. pp.031-045, ⟨10.1007/978-3-642-27654-5⟩. ⟨lirmm-00845796⟩

Share

Metrics

Record views

271