Randomness Notions and Reverse Mathematics

Abstract

We investigate the strength of a randomness notion R as a set-existence principle in second-order arithmetic: for each Z there is X that is R-random relative to Z. We show that the equivalence between 2-randomness and being infinitely often C-incompressible is provable in RCA0. We verify that RCA0 proves the basic implications among randomness notions: 2-random ⇒ weakly 2-random ⇒ Martin-Löf random ⇒ computably random ⇒ Schnorr random. Also, over RCA0 the existence of computable randoms is equivalent to the existence of Schnorr randoms. We show that the existence of balanced randoms is equivalent to the existence of Martin-Löf randoms, and we describe a sense in which this result is nearly optimal.

The Reverse Mathematics of Theorems of Jordan and Lebesgue

“…We mention that Shafer and the first author [9] have recently looked at further connections between reverse mathematics and randomness. They consider randomness notions for infinite bit sequences.…”