Pages that link to "Item:Q1426051"
From MaRDI portal
The following pages link to Analog computers and recursive functions over the reals. (Q1426051):
Displayed 15 items.
- Real recursive functions and their hierarchy (Q706790) (← links)
- Can Newtonian systems, bounded in space, time, mass and energy compute all functions? (Q870250) (← links)
- Computability of analog networks (Q870263) (← 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)
- Computational bounds on polynomial differential equations (Q1036531) (← links)
- Polynomial differential equations compute all real computable functions on computable compact intervals (Q2371306) (← links)
- Computability with polynomial differential equations (Q2482915) (← links)
- The P\(\neq\) NP conjecture in the context of real and complex analysis (Q2489146) (← links)
- Embedding infinitely parallel computation in Newtonian kinematics (Q2497873) (← links)
- Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions (Q2581262) (← links)
- Experimental computation of real numbers by Newtonian machines (Q5438843) (← links)
- Computational complexity with experiments as oracles (Q5505107) (← links)