53 research outputs found

    A Universal Ordinary Differential Equation

    Full text link
    An astonishing fact was established by Lee A. Rubel (1981): there exists a fixed non-trivial fourth-order polynomial differential algebraic equation (DAE) such that for any positive continuous function φ\varphi on the reals, and for any positive continuous function ϵ(t)\epsilon(t), it has a C\mathcal{C}^\infty solution with y(t)φ(t)<ϵ(t)| y(t) - \varphi(t) | < \epsilon(t) for all tt. Lee A. Rubel provided an explicit example of such a polynomial DAE. Other examples of universal DAE have later been proposed by other authors. However, Rubel's DAE \emph{never} has a unique solution, even with a finite number of conditions of the form y(ki)(ai)=biy^{(k_i)}(a_i)=b_i. The question whether one can require the solution that approximates φ\varphi to be the unique solution for a given initial data is a well known open problem [Rubel 1981, page 2], [Boshernitzan 1986, Conjecture 6.2]. In this article, we solve it and show that Rubel's statement holds for polynomial ordinary differential equations (ODEs), and since polynomial ODEs have a unique solution given an initial data, this positively answers Rubel's open problem. More precisely, we show that there exists a \textbf{fixed} polynomial ODE such that for any φ\varphi and ϵ(t)\epsilon(t) there exists some initial condition that yields a solution that is ϵ\epsilon-close to φ\varphi at all times. In particular, the solution to the ODE is necessarily analytic, and we show that the initial condition is computable from the target function and error function

    Polynomial Time corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length

    Full text link
    We provide an implicit characterization of polynomial time computation in terms of ordinary differential equations: we characterize the class PTIME\operatorname{PTIME} of languages computable in polynomial time in terms of differential equations with polynomial right-hand side. This result gives a purely continuous (time and space) elegant and simple characterization of PTIME\operatorname{PTIME}. This is the first time such classes are characterized using only ordinary differential equations. Our characterization extends to functions computable in polynomial time over the reals in the sense of computable analysis. This extends to deterministic complexity classes above polynomial time. This may provide a new perspective on classical complexity, by giving a way to define complexity classes, like PTIME\operatorname{PTIME}, in a very simple way, without any reference to a notion of (discrete) machine. This may also provide ways to state classical questions about computational complexity via ordinary differential equations, i.e.~by using the framework of analysis

    On the complexity of bounded time and precision reachability for piecewise affine systems

    Full text link
    Reachability for piecewise affine systems is known to be undecidable, starting from dimension 22. In this paper we investigate the exact complexity of several decidable variants of reachability and control questions for piecewise affine systems. We show in particular that the region to region bounded time versions leads to NPNP-complete or co-NPNP-complete problems, starting from dimension 22. We also prove that a bounded precision version leads to PSPACEPSPACE-complete problems

    Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length: The General Purpose Analog Computer and Computable Analysis Are Two Efficiently Equivalent Models of Computations

    Get PDF
    The outcomes of this paper are twofold. Implicit complexity. We provide an implicit characterization of polynomial time computation in terms of ordinary differential equations: we characterize the class P of languages computable in polynomial time in terms of differential equations with polynomial right-hand side. This result gives a purely continuous (time and space) elegant and simple characterization of P. We believe it is the first time such classes are characterized using only ordinary differential equations. Our characterization extends to functions computable in polynomial time over the reals in the sense of computable analysis. Our results may provide a new perspective on classical complexity, by giving a way to define complexity classes, like P, in a very simple way, without any reference to a notion of (discrete) machine. This may also provide ways to state classical questions about computational complexity via ordinary differential equations. Continuous-Time Models of Computation. Our results can also be interpreted in terms of analog computers or analog model of computation: As a side effect, we get that the 1941 General Purpose Analog Computer (GPAC) of Claude Shannon is provably equivalent to Turing machines both at the computability and complexity level, a fact that has never been established before. This result provides arguments in favour of a generalised form of the Church-Turing Hypothesis, which states that any physically realistic (macroscopic) computer is equivalent to Turing machines both at a computability and at a computational complexity level

    A Universal Ordinary Differential Equation

    Get PDF
    An astonishing fact was established by Lee A. Rubel (1981): there exists a fixed non-trivial fourth-order polynomial differential algebraic equation (DAE) such that for any positive continuous function phi on the reals, and for any positive continuous function epsilon(t), it has a C^infinity solution with | y(t) - phi(t) | < epsilon(t) for all t. Lee A. Rubel provided an explicit example of such a polynomial DAE. Other examples of universal DAE have later been proposed by other authors. However, while these results may seem very surprising, their proofs are quite simple and are frustrating for a computability theorist, or for people interested in modeling systems in experimental sciences. First, the involved notions of universality is far from usual notions of universality in computability theory. In particular, the proofs heavily rely on the fact that constructed DAE does not have unique solutions for a given initial data. This is very different from usual notions of universality where one would expect that there is clear unambiguous notion of evolution for a given initial data, for example as in computability theory. Second, the proofs usually rely on solutions that are piecewise defined. Hence they cannot be analytic, while analycity is often a key expected property in experimental sciences. Third, the proofs of these results can be interpreted more as the fact that (fourth-order) polynomial algebraic differential equations is a too loose a model compared to classical ordinary differential equations. In particular, one may challenge whether the result is really a universality result. The question whether one can require the solution that approximates phi to be the unique solution for a given initial data is a well known open problem [Rubel 1981, page 2], [Boshernitzan 1986, Conjecture 6.2]. In this article, we solve it and show that Rubel\u27s statement holds for polynomial ordinary differential equations (ODEs), and since polynomial ODEs have a unique solution given an initial data, this positively answers Rubel\u27s open problem. More precisely, we show that there exists a fixed polynomial ODE such that for any phi and epsilon(t) there exists some initial condition that yields a solution that is epsilon-close to phi at all times. The proof uses ordinary differential equation programming. We believe it sheds some light on computability theory for continuous-time models of computations. It also demonstrates that ordinary differential equations are indeed universal in the sense of Rubel and hence suffer from the same problem as DAEs for modelization: a single equation is capable of modelling any phenomenon with arbitrary precision, meaning that trying to fit a model based on polynomial DAEs or ODEs is too general (if ithas a sufficient dimension)

    On the complexity of solving polynomial initial value problems

    No full text
    International audienceIn this paper we prove that computing the solution of an initial-value problem y˙=p(y)\dot{y}=p(y) with initial condition y(t0)=y0Rdy(t_0)=y_0\in\R^d at time t0+Tt_0+T with precision eμe^{-\mu} where pp is a vector of polynomials can be done in time polynomial in the value of TT, μ\mu and Y=\sup_{t_0\leqslant u\leqslant T}\infnorm{y(u)}. Contrary to existing results, our algorithm works for any vector of polynomials pp over any bounded or unbounded domain and has a guaranteed complexity and precision. In particular we do not assume pp to be fixed, nor the solution to lie in a compact domain, nor we assume that pp has a Lipschitz constant

    On the functions generated by the general purpose analog computer

    Get PDF
    PreprintWe consider the General Purpose Analog Computer (GPAC), introduced by Claude Shannon in 1941 as a mathematical model of Differential Analysers, that is to say as a model of continuous-time analog (mechanical, and later one electronic) machines of that time. The GPAC generates as output univariate functions (i.e. functions f:R→R). In this paper we extend this model by: (i) allowing multivariate functions (i.e. functions f:Rn→Rm); (ii) introducing a notion of amount of resources (space) needed to generate a function, which allows the stratification of GPAC generable functions into proper subclasses. We also prove that a wide class of (continuous and discontinuous) functions can be uniformly approximated over their full domain. We prove a few stability properties of this model, mostly stability by arithmetic operations, composition and ODE solving, taking into account the amount of resources needed to perform each operation. We establish that generable functions are always analytic but that they can nonetheless (uniformly) approximate a wide range of nonanalytic functions. Our model and results extend some of the results from [19] to the multidimensional case, allow one to define classes of functions generated by GPACs which take into account bounded resources, and also strengthen the approximation result from [19] over a compact domain to a uniform approximation result over unbounded domains.info:eu-repo/semantics/acceptedVersio

    Polynomial time corresponds to solutions of polynomial ordinary differential equations of polynomial length

    Get PDF
    The outcomes of this article are twofold. Implicit complexity. We provide an implicit characterization of polynomial time computation in terms of ordinary differential equations: we characterize the class P of languages computable in polynomial time in terms of differential equations with polynomial right-hand side. This result gives a purely continuous elegant and simple characterization of P. We believe it is the first time complexity classes are characterized using only ordinary differential equations. Our characterization extends to functions computable in polynomial time over the reals in the sense of Computable Analysis. Our results may provide a new perspective on classical complexity, by giving a way to define complexity classes, like P, in a very simple way, without any reference to a notion of (discrete) machine. This may also provide ways to state classical questions about computational complexity via ordinary differential equations. Continuous-Time Models of Computation. Our results can also be interpreted in terms of analog computers or analog models of computation: As a side effect, we get that the 1941 General Purpose Analog Computer (GPAC) of Claude Shannon is provably equivalent to Turing machines both in terms of computability and complexity, a fact that has never been established before. This result provides arguments in favour of a generalised form of the Church-Turing Hypothesis, which states that any physically realistic (macroscopic) computer is equivalent to Turing machines both in terms of computability and complexity
    corecore