Logo image
Se connecter
Bishop's (up)crossing inequality and lower semicomputable random reals revisited
Document de travail   Open Access

Bishop's (up)crossing inequality and lower semicomputable random reals revisited

Mikhail Andreev et Alexander Shen
14/11/2025

Résumé

Upcrossing inequality Solovay random reals
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.

Fichiers et liens (1)

url
Find in HALAfficher

Indicateurs

1 Consultations de la notice

Détails

Logo image