Information and dynamical systems: A concrete measurement on sporadic dynamics

DOI10.1016/S0960-0779(01)00028-5MaRDI QIDQ5954869zbMATH OpenOpenAlexWikidataFDO

Authors Fiorella Argenti, Vieri Benci, Paola Cerrai, Alessandro Cordelli, Stefano Galatolo, Giulia Menconi

Publication date 28 April 2002

Published in Chaos, Solitons and Fractals (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0960-0779(01)00028-5

zbMATH Keywords

entropyKolmogorov complexitysporadic dynamics

Mathematics Subject Classification ID

Entropy and other invariants, isomorphism, classification in ergodic theory (37A35) Topological dynamics (37B99) Measures of information, entropy (94A17)

Review text

This paper presents a method for the study of dynamical systems based on the notation of quantity of information contained in a string. From a matematical point of view the most powerful way to define this quantity is given by the Kolmogorov complexity, or algorithmic information content (shortly AIC). The authors introduce a new compression algorithm called CASToRe which allows a direct estimation of the information content of the orbits in the \(O\)-entropy case. The method is applied to a sporadic dynamical system.

Recommendations

• Dynamical systems and computable information
• Orbit complexity and data compression
• Computational information for the logistic map at the chaos threshold
• The algorithmic information content for randomly perturbed systems
• Finite automata-models for the investigation of dynamical systems

Cites work

• Algorithmic complexity of points in dynamical systems
• Combinatorial foundations of information theory and the calculus of probabilities
• Compression of individual sequences via variable-rate coding
• scientific article; zbMATH DE number 3844071 (Why is no real title available?)
• Information, randomness and incompleteness. Papers on algorithmic information theory
• Sporadicity: Between periodic and chaotic dynamical behaviors

Cited in

(15)

• Compression and diffusion: a joint approach to detect complexity.
• Computational information for the logistic map at the chaos threshold
• On evolution of an information dynamic system and its generating operator
• Recurrence near given sets and the complexity of the Casati-Prosen map
• Data compression and genomes: a two-dimensional life domain map
• Dynamical sources in information theory: Fundamental intervals and word prefixes
• Energy and information of chaotic dynamical systems
• Toward a dynamical model for prime numbers
• The algorithmic information content for randomly perturbed systems
• Algorithmic information dynamics of cellular automata
• Numerical estimate of infinite invariant densities: application to Pesin-type identity
• On Information/Entropy Flow in Stochastic Dynamical Systems
• Non-sequential recursive pair substitution: some rigorous results
• Orbit complexity and data compression
• Information of sequences and applications

This page was built for publication: Information and dynamical systems: A concrete measurement on sporadic dynamics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5954869)