On the algorithmic descriptive complexity of attractors in topological dynamics
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913391523659776 |
|---|---|
| author | Rojas, Cristobal Sablik, Mathieu |
| author_facet | Rojas, Cristobal Sablik, Mathieu |
| contents | We study the computational problem of rigorously describing the asymptotic behaviour of topological dynamical systems up to a finite but arbitrarily small pre-specified error. More precisely, we consider the limit set of a typical orbit, both as a spatial object (attractor set) and as a statistical distribution (physical measure), and prove upper bounds on the computational resources of computing descriptions of these objects with arbitrary accuracy. We also study how these bounds are affected by different dynamical constrains and provide several examples showing that our bounds are sharp in general. In particular, we exhibit a computable interval map having a unique transitive attractor with Cantor set structure supporting a unique physical measure such that both the attractor and the measure are non computable. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2311_15234 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | On the algorithmic descriptive complexity of attractors in topological dynamics Rojas, Cristobal Sablik, Mathieu Dynamical Systems Computational Complexity 37B02, 37B10, 68Q17 We study the computational problem of rigorously describing the asymptotic behaviour of topological dynamical systems up to a finite but arbitrarily small pre-specified error. More precisely, we consider the limit set of a typical orbit, both as a spatial object (attractor set) and as a statistical distribution (physical measure), and prove upper bounds on the computational resources of computing descriptions of these objects with arbitrary accuracy. We also study how these bounds are affected by different dynamical constrains and provide several examples showing that our bounds are sharp in general. In particular, we exhibit a computable interval map having a unique transitive attractor with Cantor set structure supporting a unique physical measure such that both the attractor and the measure are non computable. |
| title | On the algorithmic descriptive complexity of attractors in topological dynamics |
| topic | Dynamical Systems Computational Complexity 37B02, 37B10, 68Q17 |
| url | https://arxiv.org/abs/2311.15234 |