Algorithmic thermodynamics
From MaRDI portal
Publication:2919939
DOI10.1017/S0960129511000521zbMath1252.82050DBLPjournals/mscs/BaezS12arXiv1010.2067OpenAlexW2912702311WikidataQ62443351 ScholiaQ62443351MaRDI QIDQ2919939
Publication date: 23 October 2012
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1010.2067
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Statistical thermodynamics (82B30)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Natural halting probabilities, partial randomness, and zeta functions
- Conservative logic
- Algorithmic entropy of sets
- A generalization of Chaitin's halting probability \(\Omega\) and halting self-similar sets
- Most programs stop quickly or never halt
- On partial randomness
- Information Theory and Statistical Mechanics
- A Theory of Program Size Formally Identical to Information Theory
- Probability Theory
- Information distance
- A formal theory of inductive inference. Part I
- On Information and Sufficiency
- An introduction to Kolmogorov complexity and its applications
This page was built for publication: Algorithmic thermodynamics