Computability of initial value problems
From MaRDI portal
Cites work
- A computable ordinary differential equation which possesses no computable solution
- A Galois connection between Turing jumps and limits
- Admissibly Represented Spaces and Qcb-Spaces
- AN EFFECTIVE CAUCHY-PEANO EXISTENCE THEOREM FOR UNIQUE SOLUTIONS
- Closed choice and a uniform low basis theorem
- Computability of Differential Equations
- Computability, noncomputability and undecidability of maximal intervals of IVPs
- Connected choice and the Brouwer fixed point theorem
- Effective computability of solutions of differential inclusions: the ten thousand monkeys approach
- Ein Kriterium für die Konstruktive Lösbarkeit der Differentialgleichung y' = f(x, y)
- Finite choice, convex choice and finding roots
- Handbook of computability and complexity in analysis
- How incomputable is the separable Hahn-Banach theorem?
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- On the topological aspects of the theory of represented spaces
- Ordinary differential equations and dynamical systems
- Subsystems of second order arithmetic
- The Failure in Computable Analysis of a Classical Existence Theorem for Differential Equations
- Weihrauch Complexity in Computable Analysis
- Weihrauch degrees, omniscience principles and weak computability
- Which set existence axioms are needed to prove the Cauchy/Peano theorem for ordinary differential equations?
This page was built for publication: Computability of initial value problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6897652)
