Orbit complexity by computable structures

DOI10.1088/0951-7715/13/5/307zbMATH Open0996.37012OpenAlexW2053232135MaRDI QIDQ4515399FDOQ4515399

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

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

zbMATH Keywords

entropyconstructive mathematicsorbit complexitytopological systems

Mathematics Subject Classification ID

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

Cited In (4)

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

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)