Complexity of Blowup Problems
From MaRDI portal
Publication:4918017
DOI10.1016/j.entcs.2008.12.019zbMath1262.03091MaRDI QIDQ4918017
Ning Zhong, Robert Rettinger, Weihrauch, Klaus
Publication date: 3 May 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2008.12.019
34A12: Initial value problems, existence, uniqueness, continuous dependence and continuation of solutions to ordinary differential equations
03D78: Computation over the reals, computable analysis
Cites Work
- Relatively recursive reals and real functions
- Classical recursion theory. Vol. II
- Computability on subsets of metric spaces.
- Computing the solution of the Korteweg-de Vries equation with arbitrary precision on Turing machines
- Computability on computable metric spaces
- IS WAVE PROPAGATION COMPUTABLE OR CAN WAVE COMPUTERS BEAT THE TURING MACHINE?
- Computable functionals
- On the definitions of computable real continuous functions
- On the computational complexity of ordinary differential equations
- Computability theory of generalized functions
- Computability, noncomputability and undecidability of maximal intervals of IVPs
- A computable ordinary differential equation which possesses no computable solution
- The Wave Equation with Computable Initial Data Whose Unique Solution Is Nowhere Computable
- Computable Real‐Valued Functions on Recursive Open and Closed Subsets of Euclidean Space
- An Algorithm for Computing Fundamental Solutions
- The Failure in Computable Analysis of a Classical Existence Theorem for Differential Equations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
