22 citations · 57 across the 23 of their papers we have counts for
Showing 2011 · math.LOShow all
2 papers · 2 filters
math.LO2011★ 4 cited
Computability of the Radon-Nikodym derivative
Mathieu Hoyrup, Cristobal Rojas, Klaus Weihrauch
We study the computational content of the Radon-Nokodym theorem from measure theory in the framework of the representation approach to computable analysis. We define computable mea…
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…