Recursive function theory and numerical analysis
From MaRDI portal
Analysis of algorithms and problem complexity (68Q25) Roundoff error (65G50) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Numerical methods for initial value problems involving ordinary differential equations (65L05) Applications of computability and recursion theory (03D80)
Cites work
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3305097 (Why is no real title available?)
- scientific article; zbMATH DE number 3182507 (Why is no real title available?)
- scientific article; zbMATH DE number 3109695 (Why is no real title available?)
- Classes of Predictably Computable Functions
- Nicht konstruktiv beweisbare Sätze der Analysis
- Recursive Real Numbers
- The primitive recursive analysis of ordinary differential equations and the complexity of their solutions
- Theory of Formal Systems. (AM-47)
- Toward Abstract Numerical Analysis
Cited in
(5)- Approximation to measurable functions and its relation to probabilistic computation
- Computing the exact number of periodic orbits for planar flows
- How much can analog and hybrid systems be proved (super-)Turing
- Continuous-time computation with restricted integration capabilities
- Computability of Differential Equations
This page was built for publication: Recursive function theory and numerical analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1216028)
