Algorithmic information and simplicity in statistical physics

DOI10.1007/BF02435782MaRDI QIDQ678643zbMATH OpenOpenAlexFDO

Authors R. Schack

Publication date 6 July 1997

Published in International Journal of Theoretical Physics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/hep-th/9409022

zbMATH Keywords

algorithmic information theory

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Abstract: Given a list of $N$ states with probabilities $0<p_{1}leqcdotsleq{p}_N$, the average conditional algorithmic information $$ to specify one of these states obeys the inequality $$, where $H=-sum{p}_{j}lo{g}_2{p}_j$ and $O(1)$ is a computer-dependent constant. We show how any universal computer can be slightly modified in such a way that the inequality becomes $$, thereby eliminating the computer-dependent constant from statistical physics.

Recommendations

• Algorithmic information theory and its statistical mechanical interpretation
• A statistical mechanical interpretation of algorithmic information theory
• Algorithmic complexity and statistical mechanics
• Algorithmic information theory for physicists and natural scientists
• A statistical mechanical interpretation of algorithmic information theory. III: Composite systems and fixed points
• The statistical mechanics of constructive algorithms
• scientific article; zbMATH DE number 15994
• Information in statistical physics
• scientific article; zbMATH DE number 7650886
• scientific article; zbMATH DE number 1216200

Cites work

• scientific article; zbMATH DE number 41062 (Why is no real title available?)
• A Method for the Construction of Minimum-Redundancy Codes
• A formal theory of inductive inference. Part I
• Algorithmic Information Theory
• Huffman codes and self-information
• Information and entropy in the baker’s map
• Irreversibility and Heat Generation in the Computing Process
• Papers on probability, statistics and statistical physics. Ed. by R. D. Rosenkrantz
• The length of a typical Huffman codeword
• The physical nature of information
• Variations on a theme by Huffman

Cited in

(8)

• Stationary algorithmic probability
• A statistical mechanical interpretation of algorithmic information theory. III: Composite systems and fixed points
• Preparation information and optimal decompositions for mixed quantum states
• Coding with minimal programs
• Phase transition and strong predictability
• A statistical mechanical interpretation of algorithmic information theory
• Algorithmic thermodynamics
• Entropic measures, Markov information sources and complexity

This page was built for publication: Algorithmic information and simplicity in statistical physics

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