Algorithmic information and simplicity in statistical physics
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.