All computable increasing sequences converging to random reals converge at the same speed up to a constant factor, as this follows immediately from Bishop's upcrossing inequality.
See also https://arxiv.org/abs/2306.12769
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.LO 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Bishop's (up)crossing inequality and lower semicomputable random reals revisited
All computable increasing sequences converging to random reals converge at the same speed up to a constant factor, as this follows immediately from Bishop's upcrossing inequality.