Dynamical systems and computable information
From MaRDI portal
Strange attractors, chaotic dynamics of systems with hyperbolic behavior (37D45) Information theory (general) (94A15) Measures of information, entropy (94A17) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Computational methods for ergodic theory (approximation of invariant measures, computation of Lyapunov exponents, entropy, etc.) (37M25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)
Abstract: We present some new results which relate information to chaotic dynamics. In our approach the quantity of information is measured by the Algorithmic Information Content (Kolmogorov complexity) or by a sort of computable version of it (Computable Information Content) in which the information is measured by the use of a suitable universal data compression algorithm. We apply these notions to the study of dynamical systems by considering the asymptotic behavior of the quantity of information necessary to describe their orbits. When a system is ergodic, this method provides an indicator which equals the Kolmogorov-Sinai entropy almost everywhere. Moreover, if the entropy is 0, our method gives new indicators which measure the unpredictability of the system and allows to classify various kind of weak chaos. Actually this is the main motivation of this work. The behaviour of a zero entropy dynamical system is far to be completely predictable exept that in particular cases. In fact there are 0 entropy systems which exibit a sort of {it weak chaos} where the information necessary to describe the orbit behavior increases with time more than logarithmically (periodic case) even if less than linearly (positive entropy case). Also, we believe that the above method is useful for the classification of zero entropy time series. To support this point of view, we show some theoretical and experimenthal results in specific cases.
Recommendations
Cited in
(27)- Textual data compression in computational biology: algorithmic techniques
- Transinformation of Chaotic Systems
- Non-sequential recursive pair substitutions and numerical entropy estimates in symbolic dynamical systems
- Information of sequences and applications
- Data compression and learning in time sequences analysis
- Toward a dynamical model for prime numbers
- scientific article; zbMATH DE number 2019801 (Why is no real title available?)
- Dynamics of information systems: mathematical foundations.
- Compactness of symbolic sequences from chaotic systems
- Optimal Information Measures for Weakly Chaotic Dynamical Systems
- Orbit complexity and data compression
- Effective symbolic dynamics, random points, statistical behavior, complexity and entropy
- Complexity for extended dynamical systems
- Information and dynamical systems: A concrete measurement on sporadic dynamics
- Computational information for the logistic map at the chaos threshold
- Data compression and genomes: a two-dimensional life domain map
- Brudno's theorem for \(\mathbb{Z}^d\) (or \(\mathbb{Z}_+^d\)) subshifts
- Embedding information onto a dynamical system
- Information density, structure and entropy in equilibrium and non-equilibrium systems
- Optimal information measures for weakly chaotic dynamical systems
- Algorithmic complexity of points in dynamical systems
- Generalized dynamical entropies in weakly chaotic systems
- Random dynamical systems, entropies and information
- Computability of entropy and information in classical Hamiltonian systems
- Algorithmic information for interval maps with an indifferent fixed point and infinite invariant measure
- Complexity, initial condition sensitivity, dimension and weak chaos in dynamical systems
- Artificial sequences and complexity measures
This page was built for publication: Dynamical systems and computable information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1884251)
