Dynamical systems and computable information

DOI10.3934/dcdsb.2004.4.935zbMath1058.94512arXivcond-mat/0210654MaRDI QIDQ1884251

Yanyan Li

Publication date: 27 October 2004

Published in: Discrete and Continuous Dynamical Systems. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cond-mat/0210654

zbMATH Keywords

data compression; universal coding; weak chaos

Mathematics Subject Classification ID

68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)

94A08: Image processing (compression, reconstruction, etc.) in information and communication theory

68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)

37D45: Strange attractors, chaotic dynamics of systems with hyperbolic behavior

94A17: Measures of information, entropy

94A15: Information theory (general)

37M25: Computational methods for ergodic theory (approximation of invariant measures, computation of Lyapunov exponents, entropy, etc.)

Related Items

Artificial sequences and complexity measures, Information density, structure and entropy in equilibrium and non-equilibrium systems, Textual data compression in computational biology: algorithmic techniques, Brudno's theorem for \(\mathbb{Z}^d\) (or \(\mathbb{Z}_+^d\)) subshifts, Non-sequential recursive pair substitutions and numerical entropy estimates in symbolic dynamical systems, Complexity for extended dynamical systems, Effective symbolic dynamics, random points, statistical behavior, complexity and entropy, Data compression and genomes: a two-dimensional life domain map, Data compression and learning in time sequences analysis, Toward a dynamical model for prime numbers, Optimal information measures for weakly chaotic dynamical systems