Orbit complexity and data compression
Stefano Galatolo · Discrete and Continuous Dynamical Systems · 2001
We consider data compression algorithms as a tool to get an approximate measure for the quantity of informationcontained in a string.By this it is possible to give a notion of orbit complexity for topological dynamical systems. In compact ergodic dynamical systems, entropy is almost everywhere equal to orbit complexity. The use of compression algorithms allows a direct estimation of the information content of the orbits.