Orbit complexity by computable structures

DOI10.1088/0951-7715/13/5/307MaRDI QIDQ4515399zbMATH OpenOpenAlexFDO

Authors Stefano Galatolo

Publication date 1 April 2001

Published in Nonlinearity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1088/0951-7715/13/5/307

zbMATH Keywords

constructive mathematicsentropyorbit complexitytopological systems

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) General groups of measure-preserving transformations (28D15) Symbolic dynamics (37B10) Topological entropy (37B40) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Orbit complexity and data compression
• Effective symbolic dynamics, random points, statistical behavior, complexity and entropy
• Global and local complexity in weakly chaotic dynamical systems
• Algorithmic complexity of points in dynamical systems
• The Complexity of Orbits of Computably Enumerable Sets

Cited in

(4)

• Effective symbolic dynamics, random points, statistical behavior, complexity and entropy
• Compression and diffusion: a joint approach to detect complexity.
• Computability and information in models of randomness and chaos
• Information of sequences and applications

This page was built for publication: Orbit complexity by computable structures

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