22 citations · 57 across the 23 of their papers we have counts for
3 papers · 1 filter
Computability on quasi-Polish spaces
Mathieu Hoyrup, Cristobal Rojas, Victor Selivanov +1
We investigate the effectivizations of several equivalent definitions of quasi-Polish spaces and study which characterizations hold effectively. Being a computable effectively open…
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…
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…