The Manneville map: topological, metric and algorithmic entropy

2001/07/27 by Claudio Bonanno, Bonanno, Claudio
Mathematics · #Dynamical Systems (math.DS) #FOS: Mathematics #math.DS

paper · pdf · doi:10.48550/arxiv.math/0107195

27 pages, 1 figure

arxiv created 2002/02/10 · arxiv updated 2009/11/30

Abstract

We study the Manneville map f(x)=x+x^z (mod 1), with z>1, from a computational point of view, studying the behaviour of the Algorithmic Information Content. In particular, we consider a family of piecewise linear maps that gives examples of algorithmic behaviour ranging from the fully to the mildly chaotic, and show that the Manneville map is a member of this family.

Related

• Puzzles of Quasi-Finite Type, Zeta Functions and Symbolic Dynamics for Multi-Dimensional Maps
• Computational information for the logistic map at the chaos threshold
• Computing the topological entropy of unimodal maps
• Heterochaos baker maps and the Dyck system: maximal entropy measures and a mechanism for the breakdown of entropy approachability
• A closed formula for the topological entropy of multimodal maps based on min-max symbols