Algorithmic information and simplicity in statistical physics

DOI10.1007/BF02435782zbMath0866.68054arXivhep-th/9409022OpenAlexW1972290811MaRDI QIDQ678643

Rüdiger 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)

Related Items (4)

Stationary algorithmic probability ⋮ CODING WITH MINIMAL PROGRAMS ⋮ Entropic measures, Markov information sources and complexity ⋮ Preparation information and optimal decompositions for mixed quantum states

Cites Work

• Unnamed Item
• Papers on probability, statistics and statistical physics. Ed. by R. D. Rosenkrantz
• The physical nature of information
• Irreversibility and Heat Generation in the Computing Process
• Algorithmic Information Theory
• Huffman codes and self-information
• Variations on a theme by Huffman
• The length of a typical Huffman codeword
• Information and entropy in the baker’s map
• A Method for the Construction of Minimum-Redundancy Codes
• A formal theory of inductive inference. Part I

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