Symbolic dynamics: entropy = dimension = complexity

DOI10.1007/s00224-014-9546-8zbMath1355.37023arXiv1702.04394OpenAlexW2102477970MaRDI QIDQ2354582

Stephen G. Simpson

Publication date: 20 July 2015

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1702.04394

zbMATH Keywords

entropyHausdorff dimensionKolmogorov complexitysymbolic dynamics

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Measures of information, entropy (94A17) Topological entropy (37B40) Symbolic dynamics (37B10)

Related Items (14)

Randomness, Computation and Mathematics ⋮ Mean dimension theory in symbolic dynamics for finitely generated amenable groups ⋮ A note on dimensional entropy for amenable group actions ⋮ AVOIDING EFFECTIVE PACKING DIMENSION 1 BELOW ARRAY NONCOMPUTABLE C.E. DEGREES ⋮ Fiber entropy and algorithmic complexity of random orbits ⋮ Constant length substitutions, iterated function systems and amorphic complexity ⋮ Computability theory. Abstracts from the workshop held January 7--13, 2018 ⋮ Computable Følner monotilings and a theorem of Brudno ⋮ Brudno's theorem for \(\mathbb{Z}^d\) (or \(\mathbb{Z}_+^d\)) subshifts ⋮ Complexity of shift spaces on semigroups ⋮ Effective Hausdorff dimension in general metric spaces ⋮ ON ENTROPIES AND COMPLEXITY FOR AMENABLE ACTIONS GROUPS ⋮ An announce of results linking Kolmogorov complexity to entropy for amenable group actions ⋮ An entropy formula over the dynamical balls and its applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A characterization of the entropies of multidimensional shifts of finite type
• The Shannon-McMillan-Breiman theorem for a class of amenable groups
• Entropy and isomorphism theorems for actions of amenable groups
• Ergodic theory on compact spaces
• Slow entropy type invariants and smooth realization of commuting measure-preserving transformations
• Bowen’s equation in the non-uniform setting
• Algorithmic Randomness and Complexity
• Algorithmic complexity of points in dynamical systems
• Statistical Mechanics on a Compact Set with Z p Action Satisfying Expansiveness and Specification
• An Introduction to Symbolic Dynamics and Coding
• Relations between varieties of kolmogorov complexities
• Topological Entropy for Noncompact Sets
• Computability and Randomness
• Elements of Information Theory
• Disjointness in ergodic theory, minimal sets, and a problem in diophantine approximation

This page was built for publication: Symbolic dynamics: entropy = dimension = complexity