Skip to main content
Log in

Computing the topological entropy of maps

  • Published:
Communications in Mathematical Physics Aims and scope Submit manuscript

Abstract

We give an algorithm for determining the topological entropy of a unimodal map of the interval given its kneading sequence. We also show that this algorithm converges exponentially in the number of letters of the kneading sequence.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Collet, P., Eckmann, J.-P.: Iterated maps on the interval as dynamical systems. Boston: Birkhäuser 1980

    Google Scholar 

  2. Crutchfield, J.P., Farmer, J.D., Huberman, B.A.: Fluctuations and simple chaotic dynamics. Physics Reports (to appear)

  3. Crutchfield, J.P., Huberman, B.A.: Fluctuations and the onset of chaos. Phys. Lett.77A, 407 (1980)

    Google Scholar 

  4. Dieudonné, J.: Foundations of modern analysis. New York, London: Academic Press 1969

    Google Scholar 

  5. Mayer-Kress, G., Haken, M.: The influence of noise on the logistic equation. J. Stat. Phys.26, 149 (1981)

    Google Scholar 

  6. Milnor, J., Thurston, W.: On iterated maps of the interval. I, II. Preprint Institute for Advanced Studies, Princeton University (1977)

  7. Crutchfield, J.P., Shaw. R.: Unpublished

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by O. E. Lanford

Rights and permissions

Reprints and permissions

About this article

Cite this article

Collet, P., Crutchfield, J.P. & Eckmann, J.P. Computing the topological entropy of maps. Commun.Math. Phys. 88, 257–262 (1983). https://doi.org/10.1007/BF01209479

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01209479

Keywords

Navigation