pith. sign in

arxiv: math/0306340 · v1 · submitted 2003-06-24 · 🧮 math.DS

Recurrence and algorithmic information

classification 🧮 math.DS
keywords algorithmicrecurrencechaoticcomplexitydetaileddynamicalexamplesfocus
0
0 comments X
read the original abstract

In this paper we initiate a somewhat detailed investigation of the relationships between quantitative recurrence indicators and algorithmic complexity of orbits in weakly chaotic dynamical systems. We mainly focus on examples.

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.