Orbit complexity by computable structures

Nonlinearity

Volumn 13, Issue 5, 2000, Pages 1531-1546

  Galatolo, Stefano ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034258126     PISSN: 09517715     EISSN: None     Source Type: Journal    
DOI: 10.1088/0951-7715/13/5/307     Document Type: Article

References (10)

1. Batterman R and White H 1996 Chaos and algorithmic complexity Found. Phys. 26 307-36
2. Brin M and Katok A 1983 On local entropy Geometric Dynamics (Lecture Notes in Mathematics vol 1007) (Berlin: Springer)
3. Brudno A A 1983 Entropy and the complexity of the trajectories of a dynamical system Trans. Moscow Math. Soc. 2 127-51
4. Chaitin G J 1987 Information, Randomness and Incompleteness. Papers on Algorithmic Information Theory (Singapore: World Scientific)
5. Ford J 1987 Directions in classical chaos Directions in Chaos vol 1 (Singapore: World Scientific) pp 1-16
6. Petersen K 1983 Ergodic Theory (Cambridge: Cambridge University Press)
7. Pesin Y B 1977 Characteristic Lyapunov exponents and smooth ergodic theory Russ. Math. Surv. 32
8. Pour-El M B and Richards J I 1988 Computability in Analysis and Physics (Berlin: Springer)
9. White H 1993 Algorithmic complexity of points in dynamical systems Ergod. Theor. Dyn. Syst. 13 807-30
10. Zvorkin A K and Levin L A 1970 The complexity of finite objects and the algorithmic-theoretic foundations of the notion of information and randomness Russ. Math. Surv. 25