Continuous Ordinary Differential Equations and Infinite Time Turing Machines

by   Olivier Bournez, et al.

We consider Continuous Ordinary Differential Equations (CODE) y'=f(y), where f is a continuous function. They are known to always have solutions for a given initial condition y(0)=y0, these solutions being possibly non unique. We restrict to our attention to a class of continuous functions, that we call greedy: they always admit unique greedy solutions, i.e. going in greedy way in some fixed direction. We prove that they can be seen as models of computation over the ordinals (Infinite Time Turing Machines, ITTM) and conversely in a very strong sense. In particular, for such ODEs, to a greedy trajectory can be associated some ordinal corresponding to some time of computation, and conversely models of computation over the ordinals can be associated to some CODE. In particular, analyzing reachability for one or the other concept with respect to greedy trajectories has the same hardness. This also brings new perspectives on analysis in Mathematics, by providing ways to translate results for ITTMs to CODEs. This also extends some recent results about the relations between ordinary differential equations and Turing machines, and more widely with (generalized) computability theory.


Continuous Ordinary Differential Equations and Ordinal Time Turing Machines

We consider Continuous Ordinary Differential Equations (CODE) y'=f(y), w...

Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines

In this paper, we analyze the problem of finding the minimum dimension n...

Approximability in the GPAC

Most of the physical processes arising in nature are modeled by either o...

Approximation Capabilities of Neural Ordinary Differential Equations

Neural Ordinary Differential Equations have been recently proposed as an...

On the Complexity of Quadratization for Polynomial Differential Equations

Chemical reaction networks (CRNs) are a standard formalism used in chemi...

Reachability of weakly nonlinear systems using Carleman linearization

In this article we introduce a solution method for a special class of no...

Please sign up or login with your details

Forgot password? Click here to reset