Pages that link to "Item:Q2482915"
From MaRDI portal
The following pages link to Computability with polynomial differential equations (Q2482915):
Displaying 28 items.
- Computational complexity of solving polynomial differential equations over unbounded domains (Q264572) (← links)
- Computation with perturbed dynamical systems (Q355515) (← links)
- An analytic system with a computable hyperbolic sink whose basin of attraction is non-computable (Q905698) (← links)
- Computational bounds on polynomial differential equations (Q1036531) (← links)
- Differential dynamic logic for hybrid systems (Q1040772) (← links)
- Simulation of Turing machine with uEAC-computable functions (Q1665037) (← links)
- Computability of ordinary differential equations (Q1670741) (← links)
- On the universality of potential well dynamics (Q1692416) (← links)
- An axiomatic approach to existence and liveness for differential equations (Q1982634) (← links)
- Programming with ordinary differential equations: some first steps towards a programming language (Q2104250) (← 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 and Dynamical Systems (Q2908425) (← links)
- Differentiability of polynomial time computable functions (Q2965520) (← links)
- Undecidable event detection problems for ODEs of dimension one and two (Q4348239) (← links)
- Characterizing Computable Analysis with Differential Equations (Q4918002) (← links)
- Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs (Q4918029) (← links)
- Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer (Q4922124) (← links)
- Average-case polynomial-time computability of hamiltonian dynamics (Q5005130) (← links)
- Computability of Differential Equations (Q5024569) (← links)
- A Universal Ordinary Differential Equation (Q5109517) (← links)
- Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems (Q5326355) (← links)
- New Computational Paradigms (Q5717036) (← 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)
- Looking at Euler flows through a contact mirror: universality and undecidability (Q6064566) (← 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)
