Pages that link to "Item:Q1349921"

The following pages link to Recursion theory on the reals and continuous-time computation (Q1349921):

Displaying 37 items.

• Computing with polynomial ordinary differential equations (Q306694) (← links)
• Recursive analysis of singular ordinary differential equations (Q638473) (← links)
• Real recursive functions and their hierarchy (Q706790) (← links)
• A characterization of computable analysis on unbounded domains using differential equations (Q719239) (← links)
• Computability of analog networks (Q870263) (← links)
• The elementary computable functions over the real numbers: applying two new techniques (Q926178) (← links)
• Computability on reals, infinite limits and differential equations (Q990444) (← links)
• A new conceptual framework for analog computation (Q1022610) (← links)
• A foundation for real recursive function theory (Q1032628) (← links)
• Computations via Newtonian and relativistic kinematic systems (Q1036523) (← links)
• What is a universal computing machine? (Q1036530) (← links)
• Achilles and the tortoise climbing up the hyper-arithmetical hierarchy (Q1274806) (← links)
• Recursive characterization of computable real-valued functions and relations (Q1349924) (← links)
• \(\mu\)-recursion and infinite limits. (Q1401321) (← links)
• Analog computers and recursive functions over the reals. (Q1426051) (← links)
• Natural computation and non-Turing models of computation (Q1434372) (← links)
• Continuous-time computation with restricted integration capabilities (Q1434373) (← links)
• Analog computation with dynamical systems (Q1586961) (← links)
• A theory of complexity for continuous time systems (Q1599194) (← links)
• A survey of recursive analysis and Moore's notion of real computation (Q1761708) (← links)
• An optical model of computation (Q1779303) (← links)
• An analog characterization of the Grzegorczyk hierarchy (Q1872639) (← links)
• Polynomial differential equations compute all real computable functions on computable compact intervals (Q2371306) (← links)
• The P\(\neq\) NP conjecture in the context of real and complex analysis (Q2489146) (← links)
• The case for hypercomputation (Q2497872) (← links)
• How much can analog and hybrid systems be proved (super-)Turing (Q2497875) (← links)
• The Church-Turing thesis: Still valid after all these years? (Q2497878) (← links)
• Analog computation beyond the Turing limit (Q2497879) (← links)
• Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions (Q2581262) (← links)
• The promise of analog computation (Q2930715) (← links)
• Some bounds on the computational power of piecewise constant derivative systems (extended abstract) (Q4571947) (← links)
• Characterizing Computable Analysis with Differential Equations (Q4918002) (← links)
• The Methods of Approximation and Lifting in Real Computation (Q4921452) (← links)
• A Survey on Analog Models of Computation (Q5024572) (← links)
• Recursion Schemes, Discrete Differential Equations and Characterization of Polynomial Time Computations (Q5092382) (← links)
• Experimental computation of real numbers by Newtonian machines (Q5438843) (← links)
• A characterization of functions over the integers computable in polynomial time using discrete ordinary differential equations (Q6116835) (← links)