The Boltzmann Entropy and Randomness Tests
Entropy · 11.04.2026 · 28 (4) · 429
DOI: 10.3390/e28040429 ↗Kurz gefasst
Fachartikel in der Zeitschrift Entropy, online erschienen am 11.04.2026. Verfasst von Peter Gács. Beteiligte Einrichtung: Computer Science Department, Boston University, Boston, MA 02215, USA. Die Arbeit nennt 17 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
In the context of the dynamical systems of classical mechanics, we introduce two new notions called “algorithmic fine-grain and coarse-grain entropy”. The fine-grain algorithmic entropy is, on the one hand, a simple variant of the randomness tests of Martin–Löf (and others) and is, on the other hand, a connecting link between description (Kolmogorov) complexity, Gibbs entropy and Boltzmann entropy. The coarse-grain entropy is a slight correction to Boltzmann’s coarse-grain entropy. Its main advantage is its less partition-dependence, which is because algorithmic entropies for different coarse grainings are approximations of one and the same fine-grain entropy. It has the desirable properties of Boltzmann entropy in a wider range of systems, including those of interest in the “thermodynamics of computation”. It also helps explain the behavior of some unusual spin systems arising from cellular automata.
Schlagwörter
Stichwörter der Autor:innen
Autor:innen und Institutionen
- Computer Science Department, Boston University, Boston, MA 02215, USA.
ORCID-Profile: Peter Gács
Zitieren
APA
Gács, P. (2026). The Boltzmann Entropy and Randomness Tests. Entropy, 28(4), 429. https://doi.org/10.3390/e28040429
Vancouver
Gács P. The Boltzmann Entropy and Randomness Tests. Entropy. 2026;28(4):429. doi:10.3390/e28040429
BibTeX
@article{Gcs2026,
author = {Gács, Peter},
title = {The Boltzmann Entropy and Randomness Tests},
journal = {Entropy},
year = {2026},
volume = {28},
number = {4},
pages = {429},
doi = {10.3390/e28040429}
}
EUVIMED