2 papers
math.LO2012
Cupping with random sets
Adam R. Day, Joseph S. Miller
We prove that a set is K-trivial if and only if it is not weakly ML-cuppable. Further, we show that a set below zero jump is K-trivial if and only if it is not ML-cuppable. These r…
math.DS2010
A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points
Laurent Bienvenu, Adam Day, Mathieu Hoyrup +2
A theorem of Kučera states that given a Martin-Löf random infinite binary sequence ω and an effectively open set A of measure less than 1, some tail of ω is not in A. We first prov…