Skip to main content

Chaos and Orbit Complexity

  • Chapter
  • 270 Accesses

Abstract

In this paper we discuss the relation between entropy, initial data sensitivity and complexity of the orbits in a dynamical system. We expose some classical result holding in the compact case and some new result for non compact dynamical systems where constructivity plays an important role.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Mane R. Ergodic theory and differentiable dynamics, Springer-Verlag, Berlin-New York, 1987.

    Book  MATH  Google Scholar 

  2. Brin M., Katok A. On local entropy in Geometric dynamics (vol 1007,Lecture notes in Matematics) (Springer, Berlin 1983).

    Google Scholar 

  3. Brudno A.A. Entropy and the complexity of the trajectories of a dyn amical system Trans. Moscow Math. Soc. 2 127–151 (1983)

    Google Scholar 

  4. Ford J. Directions in classical chaos in Directions in chaos, Vol. 1, 1–16, World Sci. Publishing, Singapore, 1987.

    Google Scholar 

  5. Galatolo S. Orbit Complexity by Computable Structures Preprint of Dipartimento di Matematica, Università di Pisa.

    Google Scholar 

  6. Zvorkin A.K., Levin L.A. The complexity of finite objects and the algorithmic theoretic foundations of the notion of information and randomness Russ. Math. Surv. 25 (1970)

    Google Scholar 

  7. Petersen K. Ergodic Theory (Cambrigdge University Press,Cambridge 1983)

    MATH  Google Scholar 

  8. M.B. Pour-El and J.I. Richards Computability in Analysis and Phisies (Springer Berlin,1988).

    Google Scholar 

  9. Batterman R.; White H. Chaos and algorithmic complexity Found. Phys. 26 (1996) no. 3, 307–336.

    Article  MathSciNet  Google Scholar 

  10. Kolmogorov, A. N.; Fomin, S. V. Elements of the theory of functions and functional analysis With a supplement, “Banach algebras”, by V. M. Tikhomirov. Sixth edition. (“Nauka”, Moscow 1989).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer Science+Business Media New York

About this chapter

Cite this chapter

Galatolo, S. (2002). Chaos and Orbit Complexity. In: Cerrai, P., Freguglia, P., Pellegrini, C. (eds) The Application of Mathematics to the Sciences of Nature. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-0591-4_5

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-0591-4_5

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-5147-4

  • Online ISBN: 978-1-4615-0591-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics