Set Descriptive Complexity of Solvable Functions
Abstract: In a recent article, we introduced and studied a precise class of dynamical systems called solvable systems. These systems present a dynamic ruled by discontinuous ordinary differential equations with solvable right-hand terms and unique evolution. They correspond to a class of systems for which a transfinite method exist to compute the solution. We also presented several examples including a nontrivial one whose solution yields, at an integer time, a real encoding of the halting set for Turing machines; therefore showcasing that the behavior of solvable systems might describe ordinal Turing computations. In the current article, we study in more depth solvable systems, using tools from descriptive set theory. By establishing a correspondence with the class of well-founded trees, we construct a coanalytic ranking over the set of solvable functions and discuss its relation with other existing rankings for differentiable functions, in particular with the Kechris-Woodin, Denjoy and Zalcwasser ranking. We prove that our ranking is unbounded below the first uncountable ordinal.
- The set of continuous functions with everywhere convergent fourier series. Transactions of the American Mathematical Society, 302(1):207–221, 1987.
- Differential Inclusions - Set-Valued Maps and Viability Theory, volume 264 of Grundlehren der mathematischen Wissenschaften. Springer, 1984. doi:10.1007/978-3-642-69512-4.
- The general purpose analog computer and computable analysis are two equivalent paradigms of analog computation. In Jin-yi Cai, S. Barry Cooper, and Angsheng Li, editors, Theory and Applications of Models of Computation, Third International Conference, TAMC 2006, Beijing, China, May 15-20, 2006, Proceedings, volume 3959 of Lecture Notes in Computer Science, pages 631–643. Springer, 2006. URL: http://dx.doi.org/10.1007/11750321_60, doi:10.1007/11750321_60.
- Solvable initial value problems ruled by discontinuous ordinary differential equations. arXiv preprint arXiv:2405.00165, 2024.
- Solving discontinuous initial value problems with unique solutions is equivalent to computing over the transfinite. In Symposium on Theoretical Aspects of Computer Science (STACS), Clermont-Ferrand, France, 2024. doi:10.4230/LIPIcs.STACS.2024.20.
- A continuous characterization of PSPACE using polynomial ordinary differential equations. Journal of Complexity, 77:101755, august 2023. doi:10.1016/j.jco.2023.101755.
- Polynomial time corresponds to solutions of polynomial ordinary differential equations of polynomial length. Journal of the ACM, 64(6):38:1–38:76, 2017. doi:10.1145/3127496.
- Effective Computability of Solutions of Differential Inclusions The Ten Thousand Monkeys Approach. Journal of Universal Computer Science, 15(6):1162–1185, 2009. doi:10.3217/jucs-015-06-1162.
- Klaus Deimling. Multivalued differential equations, volume 1. Walter de Gruyter, 2011.
- The complexity of antidifferentiation. Advances in Mathematics, 88(2):145–169, 1991.
- Aleksej F. Filippov. Differential Equations with Discontinuous Righthand Sides, volume 18 of Mathematics and Its Applications. Springer, 1988. doi:10.1007/978-94-015-7793-9.
- Characterizing time computational complexity classes with polynomial differential equations. Computability, 12(1):23–57, 2023. doi:10.3233/COM-210384.
- Analog computers and recursive functions over the reals. Journal of Complexity, 19(5):644–664, 2003. doi:10.1016/S0885-064X(03)00034-7.
- Alexander Kechris. Classical descriptive set theory, volume 156. Springer Science & Business Media, 2012.
- Ranks of differentiable functions. Mathematika, 33(2):252–278, 1986.
- Haseo Ki. The kechris-woodin rank is finer than the zalcwasser rank. Transactions of the American Mathematical Society, 347(11):4471–4484, 1995.
- 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.
- Stefan Mazurkiewicz. Über die menge der differenzierbaren funktionen. Fundamenta Mathematicae, 27(1):244–249, 1936.
- Yiannis N Moschovakis. Descriptive set theory. Number 155. American Mathematical Soc., 2009.
- Computability in analysis and physics, volume 1. Cambridge University Press, 2017.
- TI Ramsamujh. Three ordinal ranks for the set of differentiable functions. Journal of Mathematical Analysis and Applications, 158(2):539–555, 1991.
- Gerald E Sacks. Higher recursion theory, volume 2. Cambridge University Press, 2017.
- Claude E. Shannon. Mathematical theory of the differential analyser. Journal of Mathematics and Physics MIT, 20:337–354, 1941.
- Linda Westrick. An effective analysis of the denjoy rank. Notre Dame Journal of Formal Logic, 61(2), 2020. doi:10.1215/00294527-2020-0006.
- Linda Brown Westrick. Computability in ordinal ranks and symbolic dynamics. PhD thesis, UC Berkeley, 2014.
- Linda Brown Westrick. A lightface analysis of the differentiability rank. The Journal of Symbolic Logic, 79(1):240–265, 2014. doi:10.1017/jsl.2013.23.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.