Differences of halting probabilities

DOI10.1016/J.JCSS.2017.06.002zbMath1423.03144arXiv1604.00216OpenAlexW2964344050MaRDI QIDQ2402368

George Barmpalias, Andrew E. M. Lewis-Pye

Publication date: 7 September 2017

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

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

zbMATH Keywords

algorithmic randomnesscomputably enumerable realsChaitin's \(\Omega\)halting probabilities

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Algorithmic randomness and dimension (03D32)

Related Items (4)

Speedable Left-c.e. Numbers ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Computability of Real Numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Randomness and universal machines
• Algorithmic entropy of sets
• Randomness and Recursive Enumerability
• Randomness, Computability, and Density
• On Work of Barmpalias and Lewis-Pye: A Derivation on the D.C.E. Reals
• Degrees of d. c. e. reals
• Algorithmic Randomness and Complexity
• Relative randomness and real closed fields
• Randomness and Computability: Open Questions
• Randomness and halting probabilities
• From index sets to randomness in ∅ⁿ: random reals and possibly infinite computations part II
• Algorithmic Information Theory
• A Theory of Program Size Formally Identical to Information Theory
• The definition of random sequences
• Computing and Combinatorics
• Random reals and possibly infinite computations Part I: Randomness in ∅′
• Weakly computable real numbers
• Recursively enumerable reals and Chaitin \(\Omega\) numbers

This page was built for publication: Differences of halting probabilities