scientific article; zbMATH DE number 3443634
From MaRDI portal
Publication:4769046
zbMath0283.02030MaRDI QIDQ4769046
Publication date: 1970
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
General theory for ordinary differential equations (34A99) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Proof theory and constructive mathematics (03F99)
Related Items (7)
Computational complexity of solving polynomial differential equations over unbounded domains ⋮ Computational unsolvability of domains of attraction of nonlinear systems ⋮ Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach ⋮ Computable Analysis of the Abstract Cauchy Problem in a Banach Space and Its Applications (I) ⋮ Constructive analysis and thermodynamics formulations ⋮ Computability, noncomputability and undecidability of maximal intervals of IVPs ⋮ Wittgenstein and finitism
This page was built for publication: