Journal
DISCRETE AND CONTINUOUS DYNAMICAL SYSTEMS
Volume 7, Issue 3, Pages 477-486Publisher
SOUTHWEST MISSOURI STATE UNIV
DOI: 10.3934/dcds.2001.7.477
Keywords
topological dynamical systems; information; coding; entropy; orbit complexity
Categories
Ask authors/readers for more resources
We consider data compression algorithms as a tool to get an approximate measure for the quantity of information contained 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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available