Recursive function theory and numerical analysis
From MaRDI portal
Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Applications of computability and recursion theory (03D80) Roundoff error (65G50) Numerical methods for initial value problems involving ordinary differential equations (65L05) Analysis of algorithms and problem complexity (68Q25)
Cites work
- Classes of Predictably Computable Functions
- 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?)
- 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
(8)- Approximation to measurable functions and its relation to probabilistic computation
- Continuous-time computation with restricted integration capabilities
- How much can analog and hybrid systems be proved (super-)Turing
- Computability of Differential Equations
- Computing the exact number of periodic orbits for planar flows
- The complexity of computing in continuous time: space complexity is precision
- Computable analysis for extraction of certified programs and its applications
- Computation with real numbers and continuous-time dynamical systems
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)
