Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
157 tokens/sec
GPT-4o
43 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On the algorithmic descriptive complexity of attractors in topological dynamics (2311.15234v2)

Published 26 Nov 2023 in math.DS and cs.CC

Abstract: 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.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (38)
  1. Reachability analysis of dynamical systems having piecewise-constant derivatives. Theor. Comput. Sci., 138:35–65, February 1995.
  2. Perturbed turing machines and hybrid systems. In In Proceedings of the Sixteenth Annual IEEE Symposium on Logic in Computer Science. IEEE, pages 269–278. IEEE Computer Society Press, 2001.
  3. Robust computations with dynamical systems. In P. Hlinený and A. Kucera, editors, Proc. 35th International Symposium on Mathematical Foundations of Computer Science (MFCS 2010), LNCS 6281, pages 198–208. Springer, 2010.
  4. Noise vs computational intractability in dynamics. In Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, ITCS ’12, pages 128–141, New York, NY, USA, 2012. ACM.
  5. Space-bounded church-turing thesis and computational tractability of closed systems. Physical Review Letters, 115(9), 2015.
  6. Tight space-noise tradeoffs in computing the ergodic measure. Sbornik: Mathematics, 208(12):1758, 2017.
  7. M. Braverman and M. Yampolsky. Non-computable Julia sets. Journ. Amer. Math. Soc., 19(3):551–578, 2006.
  8. M. Braverman and M. Yampolsky. Constructing non-computable julia sets. In Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, STOC ’07, pages 709–716, New York, NY, USA, 2007. ACM.
  9. Wild cantor attractors exist. Annals of Mathematics, 143(1):97–130, 1996.
  10. Turing universality of the incompressible euler equations and a conjecture of moore. International Mathematics Research Notices, 2022(22):18092–18109, aug 2021.
  11. Computability and beltrami fields in euclidean space. Journal de Mathématiques Pures et Appliquées, 169:50–81, jan 2023.
  12. Constructing turing complete euler flows in dimension 3. Proceedings of the National Academy of Sciences, 118(19), may 2021.
  13. P. Collins. Continuity and computability of reachable sets. Theor. Comput. Sci., 341:162–195, 2005.
  14. V. Edited by Brattka and P. Hertling. Handbook of Computability and Complexity in Analysis. Theory and Applications of Computability. Springer, 2021.
  15. Arithmetical complexity of the language of generic limit sets of cellular automata. J. Comput. Syst. Sci., 134:20–41, 2023.
  16. Dynamics and abstract computability: computing invariant measures. Discrete and Cont. Dyn. Sys., 29(1):193 – 212, January 2011.
  17. Dynamics and abstract computability: computing invariant measures. Discrete Contin. Dyn. Syst., 29(1):193–212, 2011.
  18. Computability of topological entropy: from general systems to transformations on cantor sets and the interval. Discrete & Continuous Dynamical Systems, 40(7):4259, 2020.
  19. Computing geometric lorenz attractors with arbitrary precision. Trans. Amer. Math. Soc., 370:2955–2970, 2018.
  20. Computability, noncomputability, and hyperbolic systems. Appl. Math. Comput., 219(6):3039–3054, 2012.
  21. Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate turing machines, 2021.
  22. Benjamin Hellouin de Menibus and Mathieu Sablik. Characterization of sets of limit measures of a cellular automaton iterated on a random configuration. Ergodic Theory Dynam. Systems, 38(2):601–650, 2018.
  23. N. Israeli and N. Goldenfeld. Computational irreducibility and the predictability of complex physical systems. Physical review letters, 92(7):074105, 2004.
  24. Computability with low-dimensional dynamical systems. Theoretical Computer Science, 132(1–2):113 – 128, 1994.
  25. E. N. Lorenz. Deterministic non-periodic flow. J. Atmos. Sci., 20:130–141, 1963.
  26. J. Milnor. On the concept of attractor. Commun. Math. Phys, 99:177–195, 1985.
  27. M. Minsky. Computation: finite and infinite machines. Prentice-Hall, Inc., 1967.
  28. C. Moore. Unpredictability and undecidability in dynamical systems. Physiscal Review Letters, 64(20):2354–2357, May 1990.
  29. John Von Neumann. Theory of Self-Reproducing Automata. University of Illinois Press, Champaign, IL, USA, 1966.
  30. J. Palis. A global view of dynamics and a conjecture on the denseness of finitude of attractors. Astérisque, 261:339 – 351, 2000.
  31. Computability and complexity of ray tracing. Discrete and Computational Geometry, 11(1):265–288, 1994.
  32. Hartley Rogers, Jr. Theory of recursive functions and effective computability. MIT Press, Cambridge, MA, second edition, 1987.
  33. Computational intractability of attractors in the real quadratic family. Adv. Math., 349:941–958, 2019.
  34. How to lose at monte carlo: A simple dynamical system whose typical statistical behavior is non-computable. In Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, page 1066–1072, New York, NY, USA, 2020. Association for Computing Machinery.
  35. H. Siegelmann and E. Sontag. Turing computation with neural nets, appl. math. lett., 4(6), (1991). Appl. Math. Lett., 4(6):77–80, 1991.
  36. W. Tucker. A rigorous ode solver and smale’s 14th problem. Found. Comput. Math., 2(1):53–117, 2002.
  37. Alan M. Turing. On computable numbers, with an application to the entscheidungsproblem. Proceedings of the London Mathematical Society, 42:230–265, 1936.
  38. L.-S. Young. What are srb measures, and which dynamical systems have them? Journal of Statistical Physics, 108(5):733–754, 2002.
Citations (2)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now