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.
Similar content being viewed by others
References
Collet, P., Eckmann, J.-P.: Iterated maps on the interval as dynamical systems. Boston: Birkhäuser 1980
Crutchfield, J.P., Farmer, J.D., Huberman, B.A.: Fluctuations and simple chaotic dynamics. Physics Reports (to appear)
Crutchfield, J.P., Huberman, B.A.: Fluctuations and the onset of chaos. Phys. Lett.77A, 407 (1980)
Dieudonné, J.: Foundations of modern analysis. New York, London: Academic Press 1969
Mayer-Kress, G., Haken, M.: The influence of noise on the logistic equation. J. Stat. Phys.26, 149 (1981)
Milnor, J., Thurston, W.: On iterated maps of the interval. I, II. Preprint Institute for Advanced Studies, Princeton University (1977)
Crutchfield, J.P., Shaw. R.: Unpublished
Author information
Authors and Affiliations
Additional information
Communicated by O. E. Lanford
Rights 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
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01209479