Algorithmic information and simplicity in statistical physics
R. Schack
Abstract
Given a list of N states with probabilities 0<p1≤·s≤ pN, the average conditional algorithmic information I to specify one of these states obeys the inequality H≤ I<H+O(1), where H=-Σ pj2pj 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 H≤ I<H+1, thereby eliminating the computer-dependent constant from statistical physics.
Create a lesson
Related papers
Proof of the AGT Conjecture at Generic β
Le-Feng Chen, Kilar Zhang
Casimir operators of 4D\,, N=2 supersymmetry in the harmonic approach
Egor Eremeev, Evgeny Ivanov
Doubly-scaled planar N = 4 SYM \& Carroll Holography
Arjun Bagchi, Prateksh Dhivakar, Alok Laddha et al.
Quantum Selection of Classical Histories
Omer Guleryuz
Wess-Zumino gauge for analytic prepotentials of off-shell N=2 supergravity: bosonic sector
Nikita Zaigraev, Julia Zernina
Testing holographic computation of entanglement pseudo-entropy in dS3/ICFT2
Liang Li