Complexity theory of real functions
Complexity theory of real functions
&egr;-approximation of differential inclusions
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Computable analysis: an introduction
Computable analysis: an introduction
Ordinary Differential Equations
Ordinary Differential Equations
Characterizing Computable Analysis with Differential Equations
Electronic Notes in Theoretical Computer Science (ENTCS)
A characterization of computable analysis on unbounded domains using differential equations
Information and Computation
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
The physical Church thesis as an explanation of the Galileo thesis
Natural Computing: an international journal
| Hi-index | 0.00 |
In this note we consider the computability of the solution of the initial-value problem for ordinary differential equations with continuous right-hand side. We present algorithms for the computation of the solution using the ''thousand monkeys'' approach, in which we generate all possible solution tubes, and then check which are valid. In this way, we show that the solution of a differential equation defined by a locally Lipschitz function is computable even if the function is not effectively locally Lipschitz. We also recover a result of Ruohonen, in which it is shown that if the solution is unique, then it is computable, even if the right-hand side is not locally Lipschitz. We also prove that the maximal interval of existence for the solution must be effectively enumerable open, and give an example of a computable locally Lipschitz function which is not effectively locally Lipschitz.