Computability, noncomputability and undecidability of maximal intervals of IVPs
From MaRDI portal
Publication:3629381
DOI10.1090/S0002-9947-09-04929-0zbMath1171.65056OpenAlexW2074380651MaRDI QIDQ3629381
Ning Zhong, Jorge Buescu, Daniel Silva Graça
Publication date: 27 May 2009
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0002-9947-09-04929-0
Undecidability and degrees of sets of sentences (03D35) Numerical methods for initial value problems involving ordinary differential equations (65L05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Computational complexity of solving polynomial differential equations over unbounded domains ⋮ Computability and Dynamical Systems ⋮ Computation with perturbed dynamical systems ⋮ Computational unsolvability of domains of attraction of nonlinear systems ⋮ Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems ⋮ On Effective Convergence of Numerical Solutions for Differential Equations ⋮ Computing the exact number of periodic orbits for planar flows ⋮ Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines ⋮ A continuous characterization of PSPACE using polynomial ordinary differential equations ⋮ An analytic system with a computable hyperbolic sink whose basin of attraction is non-computable ⋮ Average-case polynomial-time computability of hamiltonian dynamics ⋮ Characterizing Computable Analysis with Differential Equations ⋮ Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach ⋮ Complexity of Blowup Problems ⋮ Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs ⋮ Computability with polynomial differential equations ⋮ Computability in planar dynamical systems ⋮ Computability, noncomputability, and hyperbolic systems ⋮ The connection between computability of a nonlinear problem and its linearization: the Hartman-Grobman theorem revisited ⋮ A characterization of computable analysis on unbounded domains using differential equations ⋮ Non computable Mandelbrot-like sets for a one-parameter complex family ⋮ Computational bounds on polynomial differential equations ⋮ Computing geometric Lorenz attractors with arbitrary precision ⋮ Computability aspects for 1st-order partial differential equations via characteristics ⋮ Computability of Differential Equations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The wave equation with computable initial data such that its unique solution is not computable
- Classical recursion theory. The theory of functions and sets of natural numbers
- IS WAVE PROPAGATION COMPUTABLE OR CAN WAVE COMPUTERS BEAT THE TURING MACHINE?
- Computable functionals
- Ein Kriterium für die Konstruktive Lösbarkeit der Differentialgleichung y' = f(x, y)
- A computable ordinary differential equation which possesses no computable solution
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- The Wave Equation with Computable Initial Data Whose Unique Solution Is Nowhere Computable
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Decision problems for differential equations
- AN EFFECTIVE CAUCHY-PEANO EXISTENCE THEOREM FOR UNIQUE SOLUTIONS
- Non-computable Julia sets
- The Failure in Computable Analysis of a Classical Existence Theorem for Differential Equations
- On Computable Numbers, with an Application to the Entscheidungsproblem
