Effective symbolic dynamics, random points, statistical behavior, complexity and entropy - Archive ouverte HAL Access content directly
Journal Articles Information and Computation Year : 2010

Effective symbolic dynamics, random points, statistical behavior, complexity and entropy

Abstract

We consider the dynamical behavior of Martin-Löf random points in dynamical systems over metric spaces with a computable dynamics and a computable invariant measure. We use computable partitions to define a sort of effective symbolic model for the dynamics. Through this construction we prove that such points have typical statistical behavior (the behavior which is typical in the Birkhoff ergodic theorem) and are recurrent. We introduce and compare some notions of complexity for orbits in dynamical systems and prove: (i) that the complexity of the orbits of random points equals the Kolmogorov-Sinaï entropy of the system, (ii) that the supremum of the complexity of orbits equals the topological entropy.
Fichier principal
Vignette du fichier
final.pdf (288.01 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

inria-00517382 , version 1 (14-09-2010)

Identifiers

Cite

Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas. Effective symbolic dynamics, random points, statistical behavior, complexity and entropy. Information and Computation, 2010, 208 (1), pp.23-41. ⟨10.1016/j.ic.2009.05.001⟩. ⟨inria-00517382⟩
191 View
222 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More