Abstract
Two definitions of the notion of a chaotic transformation are compared: sensitivity to initial conditions and sensitivity to perturbations. Only the later is compatible with the idea that information has a finite density.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arrighi, P., Dowek, G.: The principle of a finite density of information. In: Zenil, H. (ed.) Irreducibility and Computational Equivalence: Wolfram Science 10 Years After the Publication of A New Kind of Science (2012)
Bekenstein, J.D.: Universal upper bound to entropy-to-energy ratio for bounded systems. Phys. Rev. D 23, 287–298 (1981)
Berthoz, A., Simplexité, L., Jacob, O. (2009)
Dowek, G.: La notion de nombre réel : une solution simplexe? (to appear)
Gandy, R.: Church’s thesis and principles for mechanisms. In: The Kleene Symposium. North-Holland (1980)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dowek, G. (2013). Real Numbers, Chaos, and the Principle of a Bounded Density of Information. In: Bulatov, A.A., Shur, A.M. (eds) Computer Science – Theory and Applications. CSR 2013. Lecture Notes in Computer Science, vol 7913. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38536-0_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-38536-0_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38535-3
Online ISBN: 978-3-642-38536-0
eBook Packages: Computer ScienceComputer Science (R0)