Bishop's (up)crossing inequality and lower semicomputable random reals revisited
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866913081850855424 |
|---|---|
| author | Andreev, Mikhail Shen, Alexander |
| author_facet | Andreev, Mikhail Shen, Alexander |
| 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_09756 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Bishop's (up)crossing inequality and lower semicomputable random reals revisited Andreev, Mikhail Shen, Alexander Logic Information Theory 68Q45 F.1.1 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. |
| title | Bishop's (up)crossing inequality and lower semicomputable random reals revisited |
| topic | Logic Information Theory 68Q45 F.1.1 |
| url | https://arxiv.org/abs/2511.09756 |