Dynamical intricacy and average sample complexity
classification
🧮 math.DS
keywords
dynamicalaveragecomplexityemphintricacymeasuresamplebalance
read the original abstract
We propose a new way to measure the balance between freedom and coherence in a dynamical system and a new measure of its internal variability. Based on the concept of entropy and ideas from neuroscience and information theory, we define \emph{intricacy} and \emph{average sample complexity} for topological and measure-preserving dynamical systems. We establish basic properties of these quantities, show that their suprema over covers or partitions equal the ordinary entropies, compute them for many shifts of finite type, and indicate natural directions for further research.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.