Pages that link to "Item:Q3629381"
From MaRDI portal
The following pages link to Computability, noncomputability and undecidability of maximal intervals of IVPs (Q3629381):
Displaying 26 items.
- Computational complexity of solving polynomial differential equations over unbounded domains (Q264572) (← links)
- Computation with perturbed dynamical systems (Q355515) (← links)
- The connection between computability of a nonlinear problem and its linearization: the Hartman-Grobman theorem revisited (Q714846) (← links)
- A characterization of computable analysis on unbounded domains using differential equations (Q719239) (← 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)
- Computability in planar dynamical systems (Q1761693) (← links)
- Non computable Mandelbrot-like sets for a one-parameter complex family (Q1784950) (← links)
- Computability, noncomputability, and hyperbolic systems (Q2018989) (← links)
- Computability aspects for 1st-order partial differential equations via characteristics (Q2342677) (← links)
- Computability with polynomial differential equations (Q2482915) (← links)
- Computability and Dynamical Systems (Q2908425) (← links)
- On Effective Convergence of Numerical Solutions for Differential Equations (Q2943897) (← links)
- Computing geometric Lorenz attractors with arbitrary precision (Q3130791) (← links)
- Characterizing Computable Analysis with Differential Equations (Q4918002) (← links)
- Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach (Q4918008) (← links)
- Complexity of Blowup Problems (Q4918017) (← links)
- Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs (Q4918029) (← links)
- Average-case polynomial-time computability of hamiltonian dynamics (Q5005130) (← links)
- Computability of Differential Equations (Q5024569) (← links)
- Computing the exact number of periodic orbits for planar flows (Q5100021) (← links)
- Computational unsolvability of domains of attraction of nonlinear systems (Q5322874) (← links)
- Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems (Q5326355) (← 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)
