16 citations · 54 across the 28 of their papers we have counts for
Showing 2016 · math.LOShow all
2 papers · 2 filters
math.LO2016
Layerwise computability and image randomness
Laurent Bienvenu, Mathieu Hoyrup, Alexander Shen
Algorithmic randomness theory starts with a notion of an individual random object. To be reasonable, this notion should have some natural properties; in particular, an object shoul…
math.LO2016
Solovay functions and their applications in algorithmic randomness
Laurent Bienvenu, Rod Downey, Wolfgang Merkle +1
Classical versions of Kolmogorov complexity are incomputable. Nevertheless, in 1975 Solovay showed that there are computable functions such that for infinitely many st…