On Work of Barmpalias and Lewis-Pye: A Derivation on the D.C.E. Reals

DOI10.1007/978-3-319-50062-1_39zbMath1485.03165OpenAlexW2558202527MaRDI QIDQ2970985

Joseph S. Miller

Publication date: 4 April 2017

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

Full work available at URL: https://doi.org/10.1007/978-3-319-50062-1_39

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32)

Related Items (3)

Differences of halting probabilities ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Computing halting probabilities from other halting probabilities
• Randomness and Recursive Enumerability
• Randomness, Computability, and Density
• Relative randomness and real closed fields
• A Theory of Program Size Formally Identical to Information Theory
• Computing and Combinatorics
• Computability and Randomness
• Computing and Combinatorics
• Weakly computable real numbers
• Recursively enumerable reals and Chaitin \(\Omega\) numbers

This page was built for publication: On Work of Barmpalias and Lewis-Pye: A Derivation on the D.C.E. Reals