Pages that link to "Item:Q5925968"

The following pages link to Iteration, inequalities, and differentiability in analog computers (Q5925968):

Displaying 20 items.

• Real recursive functions and their hierarchy (Q706790) (← links)
• An analytic system with a computable hyperbolic sink whose basin of attraction is non-computable (Q905698) (← 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)
• Computational bounds on polynomial differential equations (Q1036531) (← links)
• Analog computers and recursive functions over the reals. (Q1426051) (← links)
• Continuous-time computation with restricted integration capabilities (Q1434373) (← 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 analog characterization of the Grzegorczyk hierarchy (Q1872639) (← links)
• Computability with polynomial differential equations (Q2482915) (← links)
• The P\(\neq\) NP conjecture in the context of real and complex analysis (Q2489146) (← links)
• A hypercomputational alien (Q2497874) (← links)
• Characterizing Computable Analysis with Differential Equations (Q4918002) (← links)
• A Survey on Analog Models of Computation (Q5024572) (← links)
• Characterizing time computational complexity classes with polynomial differential equations (Q5880938) (← links)
• Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines (Q6048001) (← links)
• A continuous characterization of PSPACE using polynomial ordinary differential equations (Q6155896) (← links)
• Robust non-computability of dynamical systems and computability of robust dynamical systems (Q6597950) (← links)