Brudno's theorem for Z^d (or Z_+^d) subshifts

DOI10.1016/J.IC.2017.01.011MaRDI QIDQ515582zbMATH OpenOpenAlexFDO

Publication date 16 March 2017

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1508.05506

\(\mathbb{Z}^d\)-action Kolmogorov complexity Kolmogorov-Sinai entropy Shannon-McMillan-Breiman theorem subshifts

Entropy and other invariants, isomorphism, classification in ergodic theory (37A35) Symbolic dynamics (37B10) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Abstract: We generalize Brudno's theorem of

1

-dimensional shift dynamical system to

m a t h b b Z^{d}

(or

m a t h b b Z_{+}^{d}

) subshifts. That is to say, in

m a t h b b Z^{d}

(or

m a t h b b Z_{+}^{d}

) subshift, the Kolmogorov-Sinai entropy is equivalent to the Kolmogorov complexity density almost everywhere for an ergodic shift-invariant measure.

Review text

In [Trans. Mosc. Math. Soc. 1983, No. 2, 127--151 (1983; Zbl 0532.28019)], \textit{A. A. Brudno} defined a complexity of the trajectory of a point in the space by using the notion of Kolmogorov complexity and showed that for an ergodic shift-invariant measure for a \(1\)-dimensional subshift the Kolmogorov complexity density is equal to the Kolmogorov-Sinai entropy almost everywhere. The authors of this paper generalize Brudno's results to the \(d\)-dimensional case (\(\mathbb{Z}^d\) or \(\mathbb{Z}_+\) subshifts).

Recommendations

Cites work

Cited in

(5)

This page was built for publication: Brudno's theorem for \(\mathbb{Z}^d\) (or \(\mathbb{Z}_+^d\)) subshifts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q515582)