Recursive analysis of singular ordinary differential equations

DOI10.1016/j.apal.2010.07.001zbMath1225.03057MaRDI QIDQ638473

Peter Buser, Bruno Scarpellini

Publication date: 12 September 2011

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2010.07.001

zbMATH Keywords

recursive analysis; recursively enumerable sets; computable ordinary differential equations

Mathematics Subject Classification ID

03F60: Constructive and recursive analysis

34A34: Nonlinear ordinary differential equations and systems

03D78: Computation over the reals, computable analysis

Related Items

Computability of Differential Equations

Cites Work

• The wave equation with computable initial data such that its unique solution is not computable
• Recursion theory on the reals and continuous-time computation
• Hypercomputation: Philosophical issues
• A recursive function, defined on a compact interval and having a continuous derivative that is not recursive
• Differential recursion
• Hypercomputation
• Computability and Noncomputability in Classical Analysis
• Abstract Computability and Its Relation to the General Purpose Analog Computer (Some Connections Between Logic, Differential Equations and Analog Computers)
• AN EFFECTIVE CAUCHY-PEANO EXISTENCE THEOREM FOR UNIQUE SOLUTIONS
• Zwei Unentscheidbare Probleme Der Analysis
• Theory and Applications of Models of Computation
• Theory and Applications of Models of Computation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item