Orbit complexity by computable structures

DOI10.1088/0951-7715/13/5/307zbMath0996.37012OpenAlexW2053232135MaRDI QIDQ4515399

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

entropyconstructive mathematicsorbit complexitytopological systems

Mathematics Subject Classification ID

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

Related Items (4)

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

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