A Note on the Differences of Computably Enumerable Reals

DOI10.1007/978-3-319-50062-1_37zbMath1485.03162arXiv1604.05192OpenAlexW2962867437MaRDI QIDQ2970983

George Barmpalias, Andrew E. M. Lewis-Pye

Publication date: 4 April 2017

Published in: Computability and Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.05192

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Algorithmic randomness and dimension (03D32)

Related Items (2)

SOME QUESTIONS OF UNIFORMITY IN ALGORITHMIC RANDOMNESS ⋮ Computability of Real Numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Computing halting probabilities from other halting probabilities
• Randomness and universal machines
• Randomness and Recursive Enumerability
• Randomness, Computability, and Density
• Degrees of d. c. e. reals
• Algorithmic Randomness and Complexity
• Relative randomness and real closed fields
• Working with strong reducibilities above totally $\omega $-c.e. and array computable degrees
• Computability and Randomness
• Weakly computable real numbers
• Recursively enumerable reals and Chaitin \(\Omega\) numbers

This page was built for publication: A Note on the Differences of Computably Enumerable Reals