On the Entropic Chaos Degree and Orbit Complexities
Abstract
There have been several approaches to measuring the ‘complexity’ of dynamical systems in literature. The entropic chaos degree (ECD) is one of them and its usefulness and applicability have been studied. However, the ECD has been used as a measure of the complexity of the whole system rather than as a measure of the complexity of an individual trajectory. In this paper we will study the ECD as a measure of the complexity of a particular orbit and we compare it with other orbit complexities such as the Brudno’s orbit complexity and Galatolo’s shadowing orbit complexity.
Fields of Study & Subjects
Mathematical Dynamics and Fractals
Computability
Logic
AI Algorithms
Advanced Topology and Set Theory
Publication details
- Journal / source
- Journal of Dynamics and Differential Equations
- Publication date
- 11 February 2026
- Language
- EN