Brudno's theorem for Z^d (or Z^d_+) subshifts
Toru Fuda, Miho Tonozaki

TL;DR
This paper extends Brudno's theorem, originally for 1D systems, to higher-dimensional lattice subshifts, establishing the equivalence of entropy and complexity density in these systems.
Contribution
It generalizes Brudno's theorem to multi-dimensional subshifts, connecting entropy and Kolmogorov complexity in higher dimensions.
Findings
Kolmogorov-Sinai entropy equals complexity density almost everywhere
Extension of Brudno's theorem to $bZ^d$ and $bZ_+^d$ subshifts
Applicable to ergodic shift-invariant measures
Abstract
We generalize Brudno's theorem of -dimensional shift dynamical system to (or ) subshifts. That is to say, in (or ) subshift, the Kolmogorov-Sinai entropy is equivalent to the Kolmogorov complexity density almost everywhere for an ergodic shift-invariant measure.
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.
Taxonomy
TopicsCellular Automata and Applications · Computability, Logic, AI Algorithms · Mathematical Dynamics and Fractals
