1 citations · 1 across the 1 of their papers we have counts for
2 papers
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…
math.LO2006★ 1 cited
On the Orbits of Computably Enumerable Sets
Peter Cholak, Rod Downey, Leo Harrington
The goal of this paper is to show there is a single orbit of the c.e. sets with inclusion, , such that the question of membership in this orbit is -complete. Th…