The following pages link to New Computational Paradigms (Q5717036):
Displaying 17 items.
- Computation with perturbed dynamical systems (Q355515) (← links)
- A note on discreteness and virtuality in analog computing (Q870262) (← links)
- Computability of analog networks (Q870263) (← links)
- A foundation for real recursive function theory (Q1032628) (← links)
- Closed-form analytic maps in one and two dimensions can simulate universal Turing machines (Q1274815) (← links)
- A survey of recursive analysis and Moore's notion of real computation (Q1761708) (← links)
- Computability and Beltrami fields in Euclidean space (Q2109116) (← links)
- Polynomial differential equations compute all real computable functions on computable compact intervals (Q2371306) (← links)
- Computability with polynomial differential equations (Q2482915) (← links)
- How much can analog and hybrid systems be proved (super-)Turing (Q2497875) (← links)
- An RNA-based theory of natural universal computation (Q2670144) (← links)
- Finite time blowup for an averaged three-dimensional Navier-Stokes equation (Q2802068) (← links)
- Reachability in Linear Dynamical Systems (Q3507439) (← links)
- Computing Omega-Limit Sets in Linear Dynamical Systems (Q3543335) (← links)
- Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs (Q4918029) (← links)
- A Survey on Analog Models of Computation (Q5024572) (← links)
- Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines (Q6048001) (← links)
