Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4662171 | Annals of Pure and Applied Logic | 2010 | 16 Pages |
Abstract
We 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.
Related Topics
Physical Sciences and Engineering
Mathematics
Logic