In mathematics and computer science, computable analysis is the study of mathematical analysis from the perspective of computability theory. It is concerned with the parts of real analysis and functional analysis that can be carried out in a computable manner. The field is closely related to constructive analysis and numerical analysis.
- Oliver Aberth (1980), Computable analysis, McGraw-Hill, 1980.
- Marian Pour-El and Ian Richards, Computability in Analysis and Physics, Springer-Verlag, 1989.
- Stephen G. Simpson (1999), Subsystems of second-order arithmetic.
- Klaus Weihrauch (2000), Computable analysis, Springer, 2000.
|This mathematical logic-related article is a stub. You can help Wikipedia by expanding it.|