The Failure in Computable Analysis of a Classical Existence Theorem for Differential Equations

DOI10.2307/2038240zbMath0219.02022OpenAlexW4250131462MaRDI QIDQ5623667

Oliver Aberth

Publication date: 1971

Full work available at URL: https://doi.org/10.2307/2038240

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60)

Related Items (15)

Computability and Analysis, a Historical Approach ⋮ Towards computability of elliptic boundary value problems in variational formulation ⋮ Computational unsolvability of domains of attraction of nonlinear systems ⋮ Seven Kinds of Computable and Constructive Infelicities in Economics ⋮ Computability of entropy and information in classical Hamiltonian systems ⋮ On the computability of binary social choice rules in an infinite society and the halting problem ⋮ Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach ⋮ Complexity of Blowup Problems ⋮ Computable Analysis of the Abstract Cauchy Problem in a Banach Space and Its Applications (I) ⋮ Computability, noncomputability and undecidability of maximal intervals of IVPs ⋮ Power series solutions of algebraic differential equations ⋮ Differential equations in constructive analysis and in the recursive realizability topos ⋮ Exact real arithmetic using centred intervals and bounded error terms ⋮ Computability aspects for 1st-order partial differential equations via characteristics ⋮ Computability of Differential Equations

Cites Work

• The primitive recursive analysis of ordinary differential equations and the complexity of their solutions
• A Chain of Inclusion Relations in Computable Analysis
• Analysis in the Computable Number Field
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The Failure in Computable Analysis of a Classical Existence Theorem for Differential Equations