On the relation between entropy and the average complexity of trajectories in dynamical systems

Computational Complexity

Volumn 9, Issue 2, 2000, Pages 146-155

  Blume, Frank ^a  

^a JOHN BROWN UNIVERSITY   (United States)

Author keywords

Algorithmic complexity; Convergence rates; Entropy; Measure preserving transformations

Indexed keywords

EID: 0034558067     PISSN: 10163328     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00001604     Document Type: Article

References (7)

1. F. BLUME (1995). The rate of entropy convergence. Doctoral dissertation, University of North Carolina at Chapel Hill.
2. F. BLUME (1997). Possible rates of entropy convergence. Ergodic Theory Dynam. Systems 17, 45-70.
3. F. BLUME (1998). Minimal rates of entropy convergence for completely ergodic systems. Israel J. Math. 108, 1-12.
4. F. BLUME (2000). Minimal rates of entropy convergence for rank one systems. Discrete Contin. Dynam. Systems 6, 773-796.
5. A. A. BRUDNO (1983). Entropy and the complexity of the trajectories of a dynamical system. Trans. Moscow Math. Soc. 2, 127-151.
6. N. D. JONES (1973). Computability Theory: An Introduction. Academic Press.
7. H. S. WHITE (1991). On the algorithmic complexity of the trajectories of points in dynamical systems. Doctoral dissertation, University of North Carolina at Chapel Hill.