A Differentially Algebraic Replacement Theorem, and Analog Computability
From MaRDI portal
Publication:3029337
DOI10.2307/2046643zbMATH Open0626.34012OpenAlexW4246883850MaRDI QIDQ3029337FDOQ3029337
Authors: Leonard Lipshitz, Lee A. Rubel 
Publication date: 1987
Full work available at URL: https://doi.org/10.2307/2046643
Recommendations
- Corrigendum to "A Differentially Algebraic Replacement Theorem, and Analog Computability"
- A Differentially Algebraic Elimination Theorem with Application to Analog Computability in the Calculus of Variations
- Axiomatizing analog algorithms
- Towards an Axiomatization of Simple Analog Algorithms
- Iteration, inequalities, and differentiability in analog computers
- On the complexity of the differential-algebraic description of analytic complexity classes
- Characterizing Computable Analysis with Differential Equations
- Representation theorems for analytic machines and computability of analytic functions
- scientific article; zbMATH DE number 3933053
- On approximate and algebraic computability over the real numbers
Computing methodologies and applications (68U99) Theoretical approximation of solutions to ordinary differential equations (34A45) Numerical analysis in abstract spaces (65J99)
Cited In (17)
- Towards an Axiomatization of Simple Analog Algorithms
- Real recursive functions and their hierarchy
- A Survey on Analog Models of Computation
- Iteration, inequalities, and differentiability in analog computers
- Computability of analog networks
- A Differentially Algebraic Elimination Theorem with Application to Analog Computability in the Calculus of Variations
- Autonomous functions
- Some mathematical limitations of the general-purpose analog computer
- A survey of recursive analysis and Moore's notion of real computation
- An analog characterization of the Grzegorczyk hierarchy
- Can Newtonian systems, bounded in space, time, mass and energy compute all functions?
- Recursion theory on the reals and continuous-time computation
- Analog computers and recursive functions over the reals.
- Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions
- Polynomial differential equations compute all real computable functions on computable compact intervals
- Embedding infinitely parallel computation in Newtonian kinematics
- An Unsolvable Cousin Problem
This page was built for publication: A Differentially Algebraic Replacement Theorem, and Analog Computability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3029337)
