Complexity of blowup problems (extended abstract)

DOI10.1016/J.ENTCS.2008.12.019zbMATH Open1262.03091OpenAlexW2039455411MaRDI QIDQ4918017FDOQ4918017

Authors: Robert Rettinger, Klaus Weihrauch, Ning Zhong 

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

Recommendations

• Topological complexity of blowup problems
• On the complexity of solving initial value problems
• On the computational complexity of ordinary differential equations
• Solving analytic differential equations in polynomial time over unbounded domains
• Computability, noncomputability and undecidability of maximal intervals of IVPs

zbMATH Keywords

differential equationblowuptype-2 theory

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78) Initial value problems, existence, uniqueness, continuous dependence and continuation of solutions to ordinary differential equations (34A12)

Cites Work

• Title not available (Why is that?)
• Computability, noncomputability and undecidability of maximal intervals of IVPs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Classical recursion theory. Vol. II
• On the definitions of computable real continuous functions
• Computable functionals
• Computability on subsets of metric spaces.
• Computability theory of generalized functions
• The computable multi-functions on multi-represented sets are closed under programming
• On the computational complexity of ordinary differential equations
• Computability on computable metric spaces
• IS WAVE PROPAGATION COMPUTABLE OR CAN WAVE COMPUTERS BEAT THE TURING MACHINE?
• A computable ordinary differential equation which possesses no computable solution
• The Wave Equation with Computable Initial Data Whose Unique Solution Is Nowhere Computable
• The Failure in Computable Analysis of a Classical Existence Theorem for Differential Equations
• Computable Real‐Valued Functions on Recursive Open and Closed Subsets of Euclidean Space
• Title not available (Why is that?)
• Computing the solution of the Korteweg-de Vries equation with arbitrary precision on Turing machines
• An Algorithm for Computing Fundamental Solutions
• Relatively recursive reals and real functions

Cited In (3)

• Topological complexity of blowup problems
• ON THE COMPLEXITY OF FINDING A NECESSARY AND SUFFICIENT CONDITION FOR BLASCHKE-OSCILLATORY EQUATIONS
• Computational aspects of the higher Nash blowup of hypersurfaces

This page was built for publication: Complexity of blowup problems (extended abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4918017)