Speedability of computably approximable reals and their approximations

DOI10.1016/J.IC.2026.105451MaRDI QIDQ7286052zbMATH OpenFDO

Authors George Barmpalias, Nan Fang, Wolfgang Merkle, Ivan Titov

Publication date 23 June 2026

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.IC.2026.105451

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A Theory of Program Size Formally Identical to Information Theory
• Algorithmic randomness and complexity.
• Differences of halting probabilities
• On Work of Barmpalias and Lewis-Pye: A Derivation on the D.C.E. Reals
• Randomness and recursive enumerability
• Randomness versus superspeedability
• Randomness, computability, and density
• Recursively enumerable reals and Chaitin \(\Omega\) numbers
• Speedable Left-c.e. Numbers
• Undecidability of the structure of the Solovay degrees of c.e. reals

Cited in

(1)

• Randomness versus superspeedability

This page was built for publication: Speedability of computably approximable reals and their approximations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7286052)