Recursion theory on the reals and continuous-time computation
From MaRDI portal
Recommendations
- A recursion theoretic foundation of computation over real numbers
- Recursive characterization of computable real-valued functions and relations
- Recursion theory. Computational aspects of definability
- scientific article; zbMATH DE number 66618
- scientific article; zbMATH DE number 2013793
- scientific article; zbMATH DE number 4131650
- Logical Approaches to Computational Barriers
- Real hypercomputation and continuity
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Recursion over realizability structures
Cites work
- 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)
- Classical recursion theory. Vol. II
- Computability with low-dimensional dynamical systems
- Generalized shifts: unpredictability and undecidability in dynamical systems
- scientific article; zbMATH DE number 3888913 (Why is no real title available?)
- scientific article; zbMATH DE number 3255438 (Why is no real title available?)
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- scientific article; zbMATH DE number 3344793 (Why is no real title available?)
- Mathematical Theory of the Differential Analyzer
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Real number models under various sets of operations
- Some mathematical limitations of the general-purpose analog computer
- The extended analog computer
Cited in
(54)- A new conceptual framework for analog computation
- A foundation for real recursive function theory
- Computations via Newtonian and relativistic kinematic systems
- What is a universal computing machine?
- Real-world computers and recursive function theory
- Achilles and the tortoise climbing up the hyper-arithmetical hierarchy
- Relatively recursive reals and real functions
- Recursive characterization of computable real-valued functions and relations
- \(\mu\)-recursion and infinite limits.
- Analog computers and recursive functions over the reals.
- Natural computation and non-Turing models of computation
- Continuous-time computation with restricted integration capabilities
- Analog computation with dynamical systems
- A theory of complexity for continuous time systems
- A survey of recursive analysis and Moore's notion of real computation
- An optical model of computation
- An analog characterization of the Grzegorczyk hierarchy
- Beyond recursive real functions
- Polynomial differential equations compute all real computable functions on computable compact intervals
- The P\(\neq\) NP conjecture in the context of real and complex analysis
- 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
- Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions
- Real hypercomputation and continuity
- scientific article; zbMATH DE number 1583876 (Why is no real title available?)
- The promise of analog computation
- Differential recursion
- Computing with polynomial ordinary differential equations
- scientific article; zbMATH DE number 1191235 (Why is no real title available?)
- scientific article; zbMATH DE number 1354146 (Why is no real title available?)
- scientific article; zbMATH DE number 2013793 (Why is no real title available?)
- scientific article; zbMATH DE number 2061062 (Why is no real title available?)
- Some bounds on the computational power of piecewise constant derivative systems
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Production en temps réel et complexité de structure de suites infinies
- Characterizing Computable Analysis with Differential Equations
- The methods of approximation and lifting in real computation
- A Survey on Analog Models of Computation
- Recursion Schemes, Discrete Differential Equations and Characterization of Polynomial Time Computations
- The New Promise of Analog Computation
- Experimental computation of real numbers by Newtonian machines
- Machines, Computations, and Universality
- New Computational Paradigms
- Iteration, inequalities, and differentiability in analog computers
- A characterization of functions over the integers computable in polynomial time using discrete ordinary differential equations
- Recursive analysis of singular ordinary differential equations
- Chomskian hierarchies of families of sets of piecewise continuous functions
- Real recursive functions and their hierarchy
- A characterization of computable analysis on unbounded domains using differential equations
- Computability of analog networks
- The elementary computable functions over the real numbers: applying two new techniques
- Computability on reals, infinite limits and differential equations
This page was built for publication: Recursion theory on the reals and continuous-time computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1349921)
