Fiber entropy and algorithmic complexity of random orbits

DOI10.3934/DCDS.2022098MaRDI QIDQ2676615zbMATH OpenOpenAlexFDO

Authors Elias Zimmermann

Publication date 28 September 2022

Published in Discrete and Continuous Dynamical Systems (Search for Journal in Brave)

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

zbMATH Keywords

conditional Kolmogorov complexityfiber entropyrandom dynamicsstep skew productstransformation bundles

Mathematics Subject Classification ID

Entropy and other invariants (28D20) Dynamical aspects of measure-preserving transformations (37A05) Topological entropy (37B40) Random iteration (37H12) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Measures of information, entropy (94A17)

Recommendations

• Algorithmic complexity of points in dynamical systems
• Measure-theoretic complexity of ergodic systems
• Asymptotic orbit complexity of infinite measure preserving transformations
• scientific article; zbMATH DE number 3487356
• Effective symbolic dynamics, random points, statistical behavior, complexity and entropy

Cites work

• Algorithmic complexity of points in dynamical systems
• Algorithmic randomness and complexity.
• An announce of results linking Kolmogorov complexity to entropy for amenable group actions
• Asymptotic orbit complexity of infinite measure preserving transformations
• Brudno's theorem for \(\mathbb{Z}^d\) (or \(\mathbb{Z}_+^d\)) subshifts
• Computable Følner monotilings and a theorem of Brudno
• Effective symbolic dynamics, random points, statistical behavior, complexity and entropy
• Entropy and algorithmic complexity in quantum information theory
• Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem
• Entropy in dynamical systems
• Entropy of random dynamical systems
• Ergodic theorems for actions of free groups and free semigroups
• Ergodic theory. Independence and dichotomies
• Examples in the entropy theory of countable group actions
• scientific article; zbMATH DE number 3787137 (Why is no real title available?)
• scientific article; zbMATH DE number 53946 (Why is no real title available?)
• scientific article; zbMATH DE number 3560403 (Why is no real title available?)
• scientific article; zbMATH DE number 1201579 (Why is no real title available?)
• scientific article; zbMATH DE number 270112 (Why is no real title available?)
• scientific article; zbMATH DE number 3280242 (Why is no real title available?)
• scientific article; zbMATH DE number 3068827 (Why is no real title available?)
• Markov Chains, Skew Products and Ergodic Theorems for “General” Dynamic Systems
• Operator ergodic theorems for actions of free semigroups and groups
• Random dynamics
• Skew products and ergodic theorems for group actions
• Symbolic dynamics: entropy = dimension = complexity
• The Shannon-McMillan-Breiman theorem beyond amenable groups

Cited in

(1)

• Fiber entropy and algorithmic complexity of random orbits

This page was built for publication: Fiber entropy and algorithmic complexity of random orbits

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