Phase Transition between Unidirectionality and Bidirectionality
From MaRDI portal
Publication:2891313
DOI10.1007/978-3-642-27654-5_16zbMath1353.03044arXiv1107.3746OpenAlexW3103026612MaRDI QIDQ2891313
Publication date: 15 June 2012
Published in: Computation, Physics and Beyond (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1107.3746
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Foundations of equilibrium statistical mechanics (82B03) Other degrees and reducibilities in computability and recursion theory (03D30) Statistical thermodynamics (82B30)
Related Items (2)
Chaitin's omega and an algorithmic phase transition ⋮ Algorithmic information theory and its statistical mechanical interpretation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Representation of left-computable \(\varepsilon \)-random reals
- Natural halting probabilities, partial randomness, and zeta functions
- A generalization of Chaitin's halting probability \(\Omega\) and halting self-similar sets
- On partial randomness
- Randomness and Recursive Enumerability
- Algorithmic Randomness and Complexity
- Partial Randomness and Dimension of Recursively Enumerable Reals
- On initial segment complexity and degrees of randomness
- Chaitin Ω Numbers and Halting Problems
- Algorithmic Information Theory
- A Theory of Program Size Formally Identical to Information Theory
- Computability and Randomness
- Recursively enumerable reals and Chaitin \(\Omega\) numbers
This page was built for publication: Phase Transition between Unidirectionality and Bidirectionality