2 citations · 2 across the 15 of their papers we have counts for
1 paper · 2 filters
Satyadev Nandakumar, Akhil S, Chandra Shekhar Tiwari
The Kučera--Gács theorem is a fundamental result in algorithmic randomness. It states that every infinite sequence X is Turing reducible to a Martin-Löf random R. This paper st…