Pages that link to "Item:Q1349921"
From MaRDI portal
The following pages link to Recursion theory on the reals and continuous-time computation (Q1349921):
Displaying 12 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)
- Characterizing Computable Analysis with Differential Equations (Q4918002) (← links)
- The Methods of Approximation and Lifting in Real Computation (Q4921452) (← 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)
