[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Document Open Access Logo

Solving Discontinuous Initial Value Problems with Unique Solutions Is Equivalent to Computing over the Transfinite

Authors Olivier Bournez , Riccardo Gozzi

PDF
Thumbnail PDF

File

LIPIcs.STACS.2024.20.pdf
  • Filesize: 0.73 MB
  • 19 pages

Document Identifiers

Author Details

Olivier Bournez
  • École polytechnique, LIX, Paris, France
Riccardo Gozzi
  • École polytechnique, LIX, Paris, France
  • University Paris-Est Créteil Val de Marne, LACL, Paris, France

Funding

  • Bournez, Olivier: Partially supported by ANR Project ∂IFFERENCE.
  • Gozzi, Riccardo: Partially supported by ANR Project ∂IFFERENCE.

Cite As Get BibTex

Olivier Bournez and Riccardo Gozzi. Solving Discontinuous Initial Value Problems with Unique Solutions Is Equivalent to Computing over the Transfinite. In 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 289, pp. 20:1-20:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024) https://doi.org/10.4230/LIPIcs.STACS.2024.20

Abstract

We study a precise class of dynamical systems that we call solvable ordinary differential equations. We prove that analog systems mathematically ruled by solvable ordinary differential equations can be used for transfinite computation, solving tasks such as the halting problem for Turing machines and any Turing jump of the halting problem in the hyperarithmetical hierarchy. We prove that the computational power of such analog systems is exactly the one of transfinite computations of the hyperarithmetical hierarchy. 
It has been proved recently that polynomial ordinary differential equations correspond unexpectedly naturally to Turing machines. Our results show that the more general exhibited class of solvable ordinary differential equations corresponds, even unexpectedly, naturally to transfinite computations. From a wide philosophical point of view, our results contribute to state that the question of whether such analog systems can be used to solve untractable problems (both for complexity for polynomial systems and for computability for solvable systems) is provably related to the question of the relations between mathematical models, models of physics and our real world.
More technically, we study a precise class of dynamical systems: bounded initial value problems involving ordinary differential equations with a unique solution. We show that the solution of these systems can still be obtained analytically even in the presence of discontinuous dynamics once we carefully select the conditions that describe how discontinuities are distributed in the domain. We call the class of right-hand terms respecting these natural and simple conditions the class of solvable ordinary differential equations. We prove that there is a method for obtaining the solution of such systems based on transfinite recursion and taking at most a countable number of steps. We explain the relevance of these systems by providing several natural examples and showcasing the fact that these solutions can be used to perform limit computations and solve tasks such as the halting problem for Turing machines and any Turing jump of the halting problem in the hyperarithmetical hierarchy.

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Ordinary differential equations
  • Computer systems organization → Analog computers
  • Theory of computation
  • Theory of computation → Models of computation
  • Theory of computation → Computability
Keywords
  • Analog models
  • computability
  • transfinite computations
  • dynamical systems

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. Jean-Pierre Aubin and Arrigo Cellina. Differential inclusions: set-valued maps and viability theory, volume 264. Springer Science & Business Media, 2012. Google Scholar
  2. Jon Barwise. Admissible Sets and Structures. Perspectives in mathematical logic. Cambridge University Press, 2016. Google Scholar
  3. O. Bournez, M. L. Campagnolo, D. S. Graça, and E. Hainry. The General Purpose Analog Computer and Computable Analysis are two equivalent paradigms of analog computation. In J.-Y. Cai, S. B. Cooper, and A. Li, editors, Proc. Theory and Applications of Models of Computation (TAMC 06), volume 3959 of Lecture Notes in Computer Science, pages 631-643. Springer, 2006. Google Scholar
  4. O. Bournez, D. S. Graça, and A. Pouly. Polynomial time corresponds to solutions of polynomial ordinary differential equations of polynomial length. Journal of the ACM, 64(6):38:1-38:76, 2017. Google Scholar
  5. Olivier Bournez, Riccardo Gozzi, Daniel S Graça, and Amaury Pouly. A continuous characterization of pspace using polynomial ordinary differential equations. Journal of Complexity, 77:101755, 2023. Google Scholar
  6. Olivier Bournez and Amaury Pouly. A universal ordinary differential equation. Logical Methods in Computer Science, 16(1), 2020. URL: https://arxiv.org/abs/1702.08328.
  7. David M Bressoud. A radical approach to Lebesgue’s theory of integration. Cambridge University Press, 2008. Google Scholar
  8. E. A. Coddington and N. Levinson. Theory of Ordinary Differential Equations. McGraw-Hill, 1955. Google Scholar
  9. P. Collins and D. S. Graça. Effective computability of solutions of differential inclusions - the ten thousand monkeys approach. Journal of Universal Computer Science, 15(6):1162-1185, 2009. Google Scholar
  10. Matthew de Brecht. Levels of discontinuity, limit-computability, and jump operators¹. Logic, computation, hierarchies, 4:79, 2014. Google Scholar
  11. Klaus Deimling. Multivalued differential equations, volume 1. Walter de Gruyter, 2011. Google Scholar
  12. Arnaud Denjoy. Une extension de l'intégrale de m. lebesgue. CR Acad. Sci. Paris, 154:859-862, 1912. Google Scholar
  13. Randall Dougherty and Alexander S Kechris. The complexity of antidifferentiation. Advances in Mathematics, 88(2):145-169, 1991. Google Scholar
  14. R. Estrada and J. Vindas. On romanovski’s lemma. Real Analysis Exchange, 35:431-444, 2010. Google Scholar
  15. Francois Fages, Guillaume Le Guludec, Olivier Bournez, and Amaury Pouly. Strong turing completeness of continuous chemical reaction networks and compilation of mixed analog-digital programs. In Computational Methods in Systems Biology-CMSB 2017, 2017. Google Scholar
  16. A. Filippov. Differential equations with discontinuous right-hand sides. Kluwer Academic Publishers, 1988. Google Scholar
  17. Riccardo Gozzi. Analog Characterization of Complexity Classes. PhD thesis, Instituto Superior Técnico, Lisbon, Portugal and University of Algarve, Faro, Portugal, 2022. Google Scholar
  18. Riccardo Gozzi and Daniel Graça. Characterizing time computational complexity classes with polynomial differential equations. Computability, 12(1):23-57, 2023. Google Scholar
  19. D. S. Graça, J. Buescu, and M. L. Campagnolo. Boundedness of the domain of definition is undecidable for polynomial ODEs. In R. Dillhage, T. Grubba, A. Sorbi, K. Weihrauch, and N. Zhong, editors, Proc. 4th International Conference on Computability and Complexity in Analysis (CCA 2007), volume 202 of Electronic Notes in Theoretical Computer Science, pages 49-57. Elsevier, 2007. Google Scholar
  20. D. S. Graça and J. F. Costa. Analog computers and recursive functions over the reals. Journal of Complexity, 19(5):644-664, 2003. Google Scholar
  21. Daniel S. Graça. Computability with Polynomial Differential Equations. PhD thesis, Instituto Superior Técnico, 2007. Google Scholar
  22. Emmanuel Hainry. Modèles de calculs sur les réels. Résultats de Comparaisons. PhD thesis, LORIA, 7 Décembre 2006. Google Scholar
  23. P. Hartman. Ordinary Differential Equations. Birkhäuser, 2nd edition, 1982. Google Scholar
  24. Peter Hertling. Topological complexity with continuous operations. Journal of Complexity, 12(4):315-338, 1996. Google Scholar
  25. A. Kawamura. Lipschitz continuous ordinary differential equations are polynomial-space complete. Computational Complexity, 19(2):305-332, 2010. Google Scholar
  26. Alexander S Kechris and W Hugh Woodin. Ranks of differentiable functions. Mathematika, 33(2):252-278, 1986. Google Scholar
  27. Haseo Ki. On the denjoy rank, the kechris-woodin rank and the zalcwasser rank. Transactions of the American Mathematical Society, 349(7):2845-2870, 1997. Google Scholar
  28. K.-I Ko. On the computational complexity of ordinary differential equations. Information and control, 58:157-194, 1983. Google Scholar
  29. Daniel S. Graça Olivier Bournez and Amaury Pouly. Polynomial Time corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length. Journal of the ACM, 64(6):38:1-38:76, 2017. URL: https://doi.org/10.1145/3127496.
  30. Amaury Pouly. Continuous models of computation: from computability to complexity. PhD thesis, Ecole Polytechnique and Unidersidade Do Algarve, 2015. Defended on july 6, 2015, Prix de Thèse de l'Ecole Polyechnique 2016, Ackermann Award 2017. URL: https://pastel.archives-ouvertes.fr/tel-01223284.
  31. M. B. Pour-El. Abstract computability and its relations to the general purpose analog computer. Transactions of the American Mathematical Society, 199:1-28, 1974. Google Scholar
  32. M. B. Pour-El and J. I. Richards. The wave equation with computable initial data such that its unique solution is not computable. Advances in Mathematics, 39:215-239, 1981. Google Scholar
  33. Marian B Pour-El and J Ian Richards. Computability in analysis and physics, volume 1. Cambridge University Press, 2017. Google Scholar
  34. TI Ramsamujh. Three ordinal ranks for the set of differentiable functions. Journal of Mathematical Analysis and Applications, 158(2):539-555, 1991. Google Scholar
  35. Hartley Rogers Jr. Theory of Recursive Functions and Effective Computability. MIT Press, April 1987. Google Scholar
  36. C. E. Shannon. Mathematical theory of the differential analyzer. Journal of Mathematics and Physics, 20:337-354, 1941. Google Scholar
  37. Linda Westrick. An effective analysis of the denjoy rank. Notre Dame Journal of Formal Logic, 61(2), 2020. Google Scholar
  38. Zygmunt Zalcwasser. Sur une propriete du champ des fonctions continues. Studia Mathematica, 2(1):63-67, 1930. Google Scholar
  39. Dongsheng Zhao. Functions whose composition with baire class one functions are baire class one. Soochow Journal of Mathematics, 33(4):543, 2007. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact