The Manneville map: topological, metric and algorithmic entropy

Simple item page
dc.creatorBonanno, Claudio
dc.date2001-07-27
dc.date2002-02-10
dc.date.accessioned2026-07-07T04:42:45Z
dc.date.available2026-07-07T04:42:45Z
dc.descriptionWe 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.
dc.description27 pages, 1 figure
dc.identifierhttps://arxiv.org/abs/math/0107195
dc.identifierhttp://arxiv.org/abs/math/0107195
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/61914
dc.subjectDynamical Systems
dc.titleThe Manneville map: topological, metric and algorithmic entropy
dc.typetext

Files

Collections

arXiv