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

DOI10.1007/978-3-319-50062-1_39MaRDI QIDQ2970985zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

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

Cited in

(3)

• scientific article; zbMATH DE number 7561692 (Why is no real title available?)
• scientific article; zbMATH DE number 7376056 (Why is no real title available?)
• Differences of halting probabilities

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

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