Reordered computable numbers

DOI10.1007/S00224-024-10183-XMaRDI QIDQ6661765zbMATH OpenFDO

Authors

Publication date 13 January 2025

Published in Theory of Computing Systems (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00224-024-10183-X

zbMATH Keywords

computable convergencedyadic seriesleft-computable numbersMartin-Löf random numbersnearly computable numbersregular numbersSolovay reduction

Mathematics Subject Classification ID

Computability and recursion theory (03Dxx) Proof theory and constructive mathematics (03Fxx) Theory of computing (68Qxx)

Cites work

• Cohesive sets and recursively enumerable Dedekind cuts
• Nearly computable real numbers
• New Computational Paradigms
• Presentations of computably enumerable reals.
• Randomness and recursive enumerability
• Randomness, computability, and density
• Recursively enumerable reals and Chaitin \(\Omega\) numbers
• Regular reals

Cited in

(1)

• Binary expansions of regular reals and reordered computable numbers

This page was built for publication: Reordered computable numbers

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