Saved in:
Bibliographic Details
Main Authors: Andreev, Mikhail, Shen, Alexander
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2511.09756
Tags: Add Tag
No Tags, Be the first to tag this record!
Table of Contents:
  • In this paper we provide an easy proof of Barmpalias--Lewis-Pye result saying that all computable increasing sequences converging to random reals converge with the same speed (up to a $c+o(1)$ factor) by noting that it immediately follows from Bishop's upcrossing inequality. We also provide a simple derivation of this inequality.