Algorithmic information and simplicity in statistical physics

From MaRDI portal
Publication:678643

DOI10.1007/BF02435782zbMATH Open0866.68054arXivhep-th/9409022OpenAlexW1972290811MaRDI QIDQ678643FDOQ678643

R. Schack

Publication date: 6 July 1997

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

Abstract: Given a list of N states with probabilities 0<p1leqcdotsleqpN, the average conditional algorithmic information to specify one of these states obeys the inequality , where H=βˆ’sumpjlog2pj 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.


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





Cites Work


Cited In (5)


Recommendations





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)