Publication:4769046
From MaRDI portal
zbMath0283.02030MaRDI QIDQ4769046
Publication date: 1970
34A99: General theory for ordinary differential equations
03D60: Computability and recursion theory on ordinals, admissible sets, etc.
03F99: Proof theory and constructive mathematics
Related Items
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), Computational unsolvability of domains of attraction of nonlinear systems, Computational complexity of solving polynomial differential equations over unbounded domains, Wittgenstein and finitism, Constructive analysis and thermodynamics formulations, Computability, noncomputability and undecidability of maximal intervals of IVPs