A computable ordinary differential equation which possesses no computable solution

DOI10.1016/0003-4843(79)90021-4zbMath0424.68028OpenAlexW2086349071WikidataQ115368833 ScholiaQ115368833MaRDI QIDQ3859258

Publication date: 1979

Published in: Annals of Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0003-4843(79)90021-4

Mathematics Subject Classification ID

Initial value problems, existence, uniqueness, continuous dependence and continuation of solutions to ordinary differential equations (34A12) Constructive and recursive analysis (03F60) Computability and recursion theory (03D99) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items

Which set existence axioms are needed to prove the Cauchy/Peano theorem for ordinary differential equations?, Approximation to measurable functions and its relation to probabilistic computation, Computability and Analysis, a Historical Approach, The promise of analog computation, Can Newtonian systems, bounded in space, time, mass and energy compute all functions?, Extensions of Hilbert's tenth problem, On Effective Convergence of Numerical Solutions for Differential Equations, Computations with oracles that measure vanishing quantities, Computability and Noncomputability in Classical Analysis, Event detection for ODES and nonrecursive hierarchies, The wave equation with computable initial data such that its unique solution is not computable, Undecidable event detection problems for ODEs of dimension one and two, Noncomputability in models of physical phenomena, On the hierarchy and extension of monotonically computable real numbers., Computability of entropy and information in classical Hamiltonian systems, The knaster-tarski fixed-point theorem is not uniformly constructive, An example of noncomputability of exponents of a system of ordinary 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, Computable Analysis of the Abstract Cauchy Problem in a Banach Space and Its Applications (I), On the computational complexity of integral equations, Dummett's case for intuitionism, The case for hypercomputation, How much can analog and hybrid systems be proved (super-)Turing, Experimental computation of real numbers by Newtonian machines, Algorithmic foundations of computable general equilibrium theory, Computability, noncomputability and undecidability of maximal intervals of IVPs, The eigenvalues of an effectively determined self-adjoint operator are computable, but the sequence of eigenvalues is not, On the computability of the set of automorphisms of the unit square, Computations via Newtonian and relativistic kinematic systems, Computational bounds on polynomial differential equations, Decision problems for differential equations, Power series solutions of algebraic differential equations, Noncomputability in analysis and physics: A complete determination of the class of noncomputable linear operators, Differential equations in constructive analysis and in the recursive realizability topos, A Domain-Theoretic Account of Picard's Theorem, Computability aspects for 1st-order partial differential equations via characteristics, The Significance of Relativistic Computation for the Philosophy of Mathematics, Programming with ordinary differential equations: some first steps towards a programming language, Computability of Differential Equations, Some Research Problems about Algebraic Differential Equations