Multiple Recurrence and Algorithmic Randomness

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 level of randomness needed for a point in a Cantor space {0, 1}N with the uniform measure and the usual shift so that effective versions of the multiple recurrence theorem of… CONTINUE READING