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

DOI10.1007/978-3-319-50062-1_39zbMATH Open1485.03165OpenAlexW2558202527MaRDI QIDQ2970985FDOQ2970985

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

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

Cited In (3)

• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)