Abstract
In this paper we provide a brief review of several results about the computability of initial-value problems (IVPs) defined with ordinary differential equations (ODEs). We will consider a variety of settings and analyze how the computability of the IVP will be affected. Computational complexity results will also be presented, as well as computable versions of some classical theorems about the asymptotic behavior of ODEs.
Cite
CITATION STYLE
Graça, D. S., & Zhong, N. (2018). Computability of ordinary differential equations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10936 LNCS, pp. 204–213). Springer Verlag. https://doi.org/10.1007/978-3-319-94418-0_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
