EUVIMEDEUVIMED entdecken
Crossref

Benign approximations and non-speedability

Rupert Hölzl, Philip Janicki

Journal of Mathematical Logic · 30.06.2026

DOI: 10.1142/s0219061326500066 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Mathematical Logic, online erschienen am 30.06.2026. Verfasst von Rupert Hölzl und 1 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

A left-computable number [Formula: see text] is called regainingly approximable if there is a computable increasing sequence [Formula: see text] of rational numbers converging to [Formula: see text] such that [Formula: see text] for infinitely many [Formula: see text]; and it is called nearly computable if there is such an [Formula: see text] such that for every computable increasing function [Formula: see text] the sequence [Formula: see text] converges computably to 0. In this paper, we study the relationship between both concepts by constructing on the one hand a non-computable number that is both regainingly approximable and nearly computable, and on the other hand a left-computable number that is nearly computable but not regainingly approximable; it then easily follows that the two notions are incomparable with nontrivial intersection. With this relationship clarified, we then hold the keys to answering an open question of Merkle and Titov: they studied speedable numbers, that is, left-computable numbers whose approximations can be sped up in a certain sense, and asked whether, among the left-computable numbers, being Martin-Löf random is equivalent to being non-speedable. As we show that the concepts of speedable and regainingly approximable numbers are equivalent within the nearly computable numbers, our second construction provides a negative answer.

Zitieren

APA

Hölzl, R., & Janicki, P. (2026). Benign approximations and non-speedability. Journal of Mathematical Logic. https://doi.org/10.1142/s0219061326500066

Vancouver

Hölzl R, Janicki P. Benign approximations and non-speedability. Journal of Mathematical Logic. 2026. doi:10.1142/s0219061326500066

BibTeX
@article{Hlzl2026,
  author = {Hölzl, Rupert and Janicki, Philip},
  title = {Benign approximations and non-speedability},
  journal = {Journal of Mathematical Logic},
  year = {2026},
  doi = {10.1142/s0219061326500066}
}
Kostenlos starten →