Analog computers and recursive functions over the reals.

DOI10.1016/S0885-064X(03)00034-7zbMath1059.68041OpenAlexW2014107656MaRDI QIDQ1426051

Daniel Silva Graça, Costa, José Félix

Publication date: 14 March 2004

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0885-064x(03)00034-7

zbMATH Keywords

Recursive functions over the realsAnalog circuitsDifferentially algebraic functionsShannon's general purpose analog computer

Mathematics Subject Classification ID

Related Items (30)

Characterizing time computational complexity classes with polynomial differential equations ⋮ Polynomial differential equations compute all real computable functions on computable compact intervals ⋮ Computing with polynomial ordinary differential equations ⋮ Compiling elementary mathematical functions into finite chemical reaction networks via a polynomialization algorithm for ODEs ⋮ Axiomatizing Analog Algorithms ⋮ 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 ⋮ On the functions generated by the general purpose analog computer ⋮ A continuous characterization of PSPACE using polynomial ordinary differential equations ⋮ Characterizing Computable Analysis with Differential Equations ⋮ Computability with polynomial differential equations ⋮ A survey of recursive analysis and Moore's notion of real computation ⋮ Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer ⋮ The P\(\neq\) NP conjecture in the context of real and complex analysis ⋮ Real recursive functions and their hierarchy ⋮ A Universal Ordinary Differential Equation ⋮ Embedding infinitely parallel computation in Newtonian kinematics ⋮ Experimental computation of real numbers by Newtonian machines ⋮ A characterization of computable analysis on unbounded domains using differential equations ⋮ Computability on reals, infinite limits and differential equations ⋮ A new conceptual framework for analog computation ⋮ A foundation for real recursive function theory ⋮ Computations via Newtonian and relativistic kinematic systems ⋮ Computational bounds on polynomial differential equations ⋮ Computational complexity with experiments as oracles ⋮ Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions ⋮ Programming with ordinary differential equations: some first steps towards a programming language ⋮ Computability of Differential Equations ⋮ A Survey on Analog Models of Computation

Cites Work

• Computability with low-dimensional dynamical systems
• Recursion theory on the reals and continuous-time computation
• The differential analyzer. A new machine for solving differential equations
• An analog characterization of the Grzegorczyk hierarchy
• A Differentially Algebraic Replacement Theorem, and Analog Computability
• Abstract Computability and Its Relation to the General Purpose Analog Computer (Some Connections Between Logic, Differential Equations and Analog Computers)
• Unpredictability and undecidability in dynamical systems
• Mathematical Theory of the Differential Analyzer
• Algebra
• Iteration, inequalities, and differentiability in analog computers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Analog computers and recursive functions over the reals.