Recursion theory on the reals and continuous-time computation
From MaRDI portal
Publication:1349921
DOI10.1016/0304-3975(95)00248-0zbMath0871.68027OpenAlexW1992205856WikidataQ56140171 ScholiaQ56140171MaRDI QIDQ1349921
Publication date: 27 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(95)00248-0
Recursive functions and relations, subrecursive hierarchies (03D20) General topics in the theory of software (68N01)
Related Items
An analog characterization of the Grzegorczyk hierarchy ⋮ Polynomial differential equations compute all real computable functions on computable compact intervals ⋮ Computing with polynomial ordinary differential equations ⋮ Recursive characterization of computable real-valued functions and relations ⋮ The promise of analog computation ⋮ Computability of analog networks ⋮ Some bounds on the computational power of piecewise constant derivative systems (extended abstract) ⋮ A characterization of functions over the integers computable in polynomial time using discrete ordinary differential equations ⋮ \(\mu\)-recursion and infinite limits. ⋮ Recursive analysis of singular ordinary differential equations ⋮ Analog computers and recursive functions over the reals. ⋮ The elementary computable functions over the real numbers: applying two new techniques ⋮ Natural computation and non-Turing models of computation ⋮ Continuous-time computation with restricted integration capabilities ⋮ Iteration, inequalities, and differentiability in analog computers ⋮ Characterizing Computable Analysis with Differential Equations ⋮ The Methods of Approximation and Lifting in Real Computation ⋮ A survey of recursive analysis and Moore's notion of real computation ⋮ The P\(\neq\) NP conjecture in the context of real and complex analysis ⋮ Real recursive functions and their hierarchy ⋮ The case for hypercomputation ⋮ How much can analog and hybrid systems be proved (super-)Turing ⋮ The Church-Turing thesis: Still valid after all these years? ⋮ Analog computation beyond the Turing limit ⋮ An optical model of computation ⋮ 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 ⋮ Recursion Schemes, Discrete Differential Equations and Characterization of Polynomial Time Computations ⋮ Achilles and the tortoise climbing up the hyper-arithmetical hierarchy ⋮ A foundation for real recursive function theory ⋮ Computations via Newtonian and relativistic kinematic systems ⋮ What is a universal computing machine? ⋮ Analog computation with dynamical systems ⋮ Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions ⋮ A theory of complexity for continuous time systems ⋮ A Survey on Analog Models of Computation
Cites Work
- Some mathematical limitations of the general-purpose analog computer
- Classical recursion theory. Vol. II
- Real number models under various sets of operations
- Computability with low-dimensional dynamical systems
- The extended analog computer
- 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)
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Generalized shifts: unpredictability and undecidability in dynamical systems
- Mathematical Theory of the Differential Analyzer
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
