Decidability of chaos for some families of dynamical systems

Foundations of Computational Mathematics

Volumn 4, Issue 3, 2004, Pages 269-275

  Arbieto, Alexander ^a   Matheus, Carlos ^a  

^a IMPA   (Brazil)

Author keywords

Chaos; Decidability; Lyapounov exponents; SRB measures; Topological entropy

Indexed keywords

AUTOMATIC MACHINES; DYNAMICAL SYSTEMS; HYPERBOLICITY; TOPOLOGICAL ENTROPY;

ALGEBRA; ALGORITHMS; COMPUTATIONAL METHODS; DYNAMIC PROGRAMMING; FUNCTIONS; INTEGER PROGRAMMING; LYAPUNOV METHODS; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING; TOPOLOGY;

COMPUTABILITY AND DECIDABILITY;

EID: 4744348275     PISSN: 16153375     EISSN: 16153383     Source Type: Journal    
DOI: 10.1007/s10208-003-0085-y     Document Type: Article

References (17)

1. 2 on (-1, 1), Ann. of Math. 122, (1985), 1-25.
2. M. Benedicks and L. Carleson, The dynamics of the Hénon map, Ann. of Math. 133, (1991), 73-169.
3. M. Benedicks and L. S. Young, Sinai-Bowen-Ruelle measures for certain Hénon maps, Invent. Math. 112, (1993), 541-576.
4. L. Blum, M. Snub, and S. Smale, On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines, Bull. Amer. Math. Soc. 21 (1989), 1-46.
5. L. Blum and S. Smale, The Godel incompleteness theorem and decidability over a ring, From Topology to Computation: Proceedings of the Smalefest, 1993, pp. 321-339.
6. L. Carleson, The dynamics of non-uniformly hyperbolic systems in two variables, Proceedings of the International Congress of Mathematicians, Vols. I, II (Kyoto, 1990), Mathematical Society of Japan, Tokyo, 1991, pp. 1241-1247.
7. W. de Melo and S. van Strien, One-Dimensional Dynamics, Springer-Verlag, New York, 1993.
8. J. Graczyk and G. Światek, Generic hyperbolicity in the logistic family, Ann. of Math. 146, (1997), 1-52.
9. M. Jakobson, Absolutely continuous invariant measures for one-parameter families of one-dimensional maps, Comm. Math. Phys. 81, (1981), 39-88.
10. M. Lyubich, Dynamics of quadratic polynomials. I, II, Acta Math. 178 (1997), 185-247, 247-297.
11. A. A. Markov, Proceedings of ICM, (1958), 300-306.
12. J. Milnor, A problem: Is entropy effectively computable? http://www.math.sunysb.edu/~jack/PREPR/index.html
13. P. S. Novikov, On the algorithmic unsolvability of the word problem in group theory, Amer. Math. Soc. Translations, Ser. 2, Vol. 9, 1985, pp. 1-122.
14. R. Penrose, The Emperor's New Mind, Oxford University Press, Oxford, 1989.
15. S. Smale, Mathematical problems for the next century, in Mathematics: Frontiers and Perspectives, American Mathematical Socieyt, Providence, RI, 2000, pp. 271-294.
16. M. Shishikura, The Hausdorff dimension of the boundary of the Mandelbrot set and Julia set, Ann. of Math. 147 (1998), 225-267.
17. Widodo, Topological entropy of shift function on the sequences space induced by expanding piecewise linear transformations, Discrete Cont. Dynam Systems, Ser. A 8, (2002), 191-208.