Statistical complexity without explicit reference to underlying probabilities
F. Pennini, A. Plastino

TL;DR
This paper introduces a new way to measure statistical complexity in simple, non-interacting particle systems without relying on probability, demonstrating that such systems can be both thermally stable and complex.
Contribution
It extends the concept of statistical complexity to configurations of particles without using probabilities, providing a novel perspective on system complexity.
Findings
Simple particle systems can be thermally stable and complex
Statistical complexity can be defined without explicit probabilities
Configurational properties reveal complexity in simple systems
Abstract
We show that extremely simple systems of a not too large number of particles can be simultane- ously thermally stable and complex. To such an end, we extend the statistical complexity's notion to simple configurations of non-interacting particles, without appeal to probabilities, and discuss configurational properties.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
