Recursive function theory and numerical analysis

DOI10.1016/S0022-0000(70)80043-5zbMath0302.65054MaRDI QIDQ1216028

Webb Miller

Publication date: 1970

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Roundoff error (65G50) Numerical methods for initial value problems involving ordinary differential equations (65L05) Applications of computability and recursion theory (03D80) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items

Approximation to measurable functions and its relation to probabilistic computation, Computing the exact number of periodic orbits for planar flows, Continuous-time computation with restricted integration capabilities, How much can analog and hybrid systems be proved (super-)Turing, Computability of Differential Equations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The primitive recursive analysis of ordinary differential equations and the complexity of their solutions
• Theory of Formal Systems. (AM-47)
• Classes of Predictably Computable Functions
• Toward Abstract Numerical Analysis
• Nicht konstruktiv beweisbare Sätze der Analysis
• Recursive Real Numbers