16 citations · 54 across the 28 of their papers we have counts for
Showing 2011 · math.LOShow all
3 papers · 2 filters
math.LO2011
Effective randomness, strong reductions and Demuth's theorem
Laurent Bienvenu, Christopher Porter
We study generalizations of Demuth's Theorem, which states that the image of a Martin-Löf random real under a tt-reduction is either computable or Turing equivalent to a Martin-Löf…
math.LO2011★ 1 cited
Random semicomputable reals revisited
Laurent Bienvenu, Alexander Shen
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). T…
math.LO2011
Algorithmic tests and randomness with respect to a class of measures
Laurent Bienvenu, Peter Gacs, Mathieu Hoyrup +2
The paper considers quantitative versions of different randomness notions: algorithmic test measures the amount of non-randomness (and is infinite for non-random sequences). We sta…