AbstractWe investigate systems of ordinary differential equations with a parameter. We show that under suitable assumptions on the systems the solutions are computable in the sense of recursive analysis. As an application we give a complete characterization of the recursively enumerable sets using Fourier coefficients of recursive analytic functions that are generated by differential equations and elementary operations
AbstractRecursion theory on the reals, the analog counterpart of recursive function theory, is an ap...
Here ordinary differential equations of third and higher order are considered; in particular, a clas...
We summarize here the main results in the theory of ordinary differential equations (ODEs). After re...
AbstractWe investigate systems of ordinary differential equations with a parameter. We show that und...
AbstractThe functions of Computable Analysis are defined by enhancing the capacities of normal Turin...
Let (®, ¯) ½ R denote the maximal interval of existence of solution for the initial-value problem ...
This paper investigates the computability of recurrence equations. We first recall the results estab...
The concept and use of recursion operators is well-established in the study of evolution, in particu...
AbstractThe functions of computable analysis are defined by enhancing normal Turing machines to deal...
Abstract. Here ordinary differential equations of third and higher order are considered; in partic-u...
. We present an algorithm to determine the essential singular components of an algebraic differentia...
This paper studies the expressive and computational power of discrete Ordinary Differential Equation...
AbstractSolutions of differential equations are derived by a recursive procedure. For partial differ...
AbstractWe present algorithms that determine coefficients in the expansions of solutions of linear d...
Recently, using a limit schema, we presented an analog and machine independent algebraic characteriz...
AbstractRecursion theory on the reals, the analog counterpart of recursive function theory, is an ap...
Here ordinary differential equations of third and higher order are considered; in particular, a clas...
We summarize here the main results in the theory of ordinary differential equations (ODEs). After re...
AbstractWe investigate systems of ordinary differential equations with a parameter. We show that und...
AbstractThe functions of Computable Analysis are defined by enhancing the capacities of normal Turin...
Let (®, ¯) ½ R denote the maximal interval of existence of solution for the initial-value problem ...
This paper investigates the computability of recurrence equations. We first recall the results estab...
The concept and use of recursion operators is well-established in the study of evolution, in particu...
AbstractThe functions of computable analysis are defined by enhancing normal Turing machines to deal...
Abstract. Here ordinary differential equations of third and higher order are considered; in partic-u...
. We present an algorithm to determine the essential singular components of an algebraic differentia...
This paper studies the expressive and computational power of discrete Ordinary Differential Equation...
AbstractSolutions of differential equations are derived by a recursive procedure. For partial differ...
AbstractWe present algorithms that determine coefficients in the expansions of solutions of linear d...
Recently, using a limit schema, we presented an analog and machine independent algebraic characteriz...
AbstractRecursion theory on the reals, the analog counterpart of recursive function theory, is an ap...
Here ordinary differential equations of third and higher order are considered; in particular, a clas...
We summarize here the main results in the theory of ordinary differential equations (ODEs). After re...