55 citations · 164 across the 24 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
math.LO2016
Lowness, randomness, and computable analysis
André Nies
Analytic concepts contribute to our understanding of randomness of reals via algorithmic tests. They also influence the interplay between randomness and lowness notions. We provide…
math.LO2016
Multiple Recurrence and Algorithmic Randomness
Rodney G. Downey, Satyadev Nandakumar, Andre Nies
This work contributes to the programme of studying effective versions of "almost everywhere" theorems in analysis and ergodic theory via algorithmic randomness. We determine the le…
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…