A Differentially Algebraic Replacement Theorem, and Analog Computability

DOI10.2307/2046643zbMath0626.34012OpenAlexW4246883850MaRDI QIDQ3029337

Leonard Lipshitz, Lee A. Rubel

Publication date: 1987

Full work available at URL: https://doi.org/10.2307/2046643

zbMATH Keywords

algebraic differential equationanalytic solutionsdifferentially algebraic replacement theorems

Mathematics Subject Classification ID

Theoretical approximation of solutions to ordinary differential equations (34A45) Computing methodologies and applications (68U99) Numerical analysis in abstract spaces (65J99)

Related Items (16)

An analog characterization of the Grzegorczyk hierarchy ⋮ Polynomial differential equations compute all real computable functions on computable compact intervals ⋮ An Unsolvable Cousin Problem ⋮ Recursion theory on the reals and continuous-time computation ⋮ Real-time computability of real numbers by chemical reaction networks ⋮ Can Newtonian systems, bounded in space, time, mass and energy compute all functions? ⋮ Computability of analog networks ⋮ Autonomous functions ⋮ Some mathematical limitations of the general-purpose analog computer ⋮ Analog computers and recursive functions over the reals. ⋮ Iteration, inequalities, and differentiability in analog computers ⋮ A survey of recursive analysis and Moore's notion of real computation ⋮ Real recursive functions and their hierarchy ⋮ Embedding infinitely parallel computation in Newtonian kinematics ⋮ Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions ⋮ A Survey on Analog Models of Computation

This page was built for publication: A Differentially Algebraic Replacement Theorem, and Analog Computability