View in EDS

Speedability of computably approximable reals and their approximations.

Saved in:
Bibliographic Details
Title: Speedability of computably approximable reals and their approximations.
Authors: Barmpalias, George1 (AUTHOR) barmpalias@gmail.com, Fang, Nan1 (AUTHOR) fangnan@ios.ac.cn, Merkle, Wolfgang2 (AUTHOR) merkle@math.uni-heidelberg.de, Titov, Ivan2,3 (AUTHOR) me@ivantitov.de
Source: Information & Computation. Jun2026, Vol. 311, pN.PAG-N.PAG. 1p.
Subjects: Real numbers, Algorithmic randomness, Recursion theory
Abstract: An approximation of a real is a sequence of rational numbers that converges to the real. An approximation is left-c.e. if it is computable and nondecreasing and is d.c.e. if it is computable and has bounded variation. A real is computably approximable if it has some computable approximation, and left-c.e. and d.c.e. reals are defined accordingly. An approximation { a s } s ∈ ω is speedable if there exists a nondecreasing computable function f such that the approximation { a f (s) } s ∈ ω converges in a certain formal sense faster than { a s } s ∈ ω. This leads to various notions of speedability for reals, e.g., one may require for a computably approximable real that either all or some of its approximations of a specific type are speedable. Merkle and Titov established the equivalence of several speedability notions for left-c.e. reals that are defined in terms of left-c.e. approximations. We extend these results to d.c.e. reals and d.c.e. approximations, and we prove that in this setting, being speedable is equivalent to not being Martin-Löf random. Finally, we demonstrate that every computably approximable real has a computable approximation that is speedable. [ABSTRACT FROM AUTHOR]
Copyright of Information & Computation is the property of Academic Press Inc. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:An approximation of a real is a sequence of rational numbers that converges to the real. An approximation is left-c.e. if it is computable and nondecreasing and is d.c.e. if it is computable and has bounded variation. A real is computably approximable if it has some computable approximation, and left-c.e. and d.c.e. reals are defined accordingly. An approximation { a s } s ∈ ω is speedable if there exists a nondecreasing computable function f such that the approximation { a f (s) } s ∈ ω converges in a certain formal sense faster than { a s } s ∈ ω. This leads to various notions of speedability for reals, e.g., one may require for a computably approximable real that either all or some of its approximations of a specific type are speedable. Merkle and Titov established the equivalence of several speedability notions for left-c.e. reals that are defined in terms of left-c.e. approximations. We extend these results to d.c.e. reals and d.c.e. approximations, and we prove that in this setting, being speedable is equivalent to not being Martin-Löf random. Finally, we demonstrate that every computably approximable real has a computable approximation that is speedable. [ABSTRACT FROM AUTHOR]
ISSN:08905401
DOI:10.1016/j.ic.2026.105451