Reordered computable numbers

DOI10.1007/s00224-024-10183-xMaRDI QIDQ6661765

Unnamed Author

Publication date: 13 January 2025

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

zbMATH Keywords

regular numberscomputable convergencenearly computable numbersdyadic seriesleft-computable numbersMartin-Löf random numbersSolovay reduction

Mathematics Subject Classification ID

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

Cites Work

• Presentations of computably enumerable reals.
• Cohesive sets and recursively enumerable Dedekind cuts
• Randomness and Recursive Enumerability
• Randomness, Computability, and Density
• Regular reals
• New Computational Paradigms
• Recursively enumerable reals and Chaitin \(\Omega\) numbers
• Nearly computable real numbers

This page was built for publication: Reordered computable numbers