Analysis in the Computable Number Field
- 1 April 1968
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 15 (2) , 275-299
- https://doi.org/10.1145/321450.321460
Abstract
It is well known that real variable analysis is nonconstructive. For example, although it is asserted that every bounded monotone sequence converges to a limit, there is no algorithm for obtaining this limit. This paper presents a constructive analysis which is restricted to a countable set of numbers, the field of computable numbers. These numbers are defined in a new way by employing the concept of “programmable functions.” The resultant analysis differs from real analysis in many important respects.Keywords
This publication has 6 references indexed in Scilit:
- On computable sequencesFundamenta Mathematicae, 1957
- Rekursive reelle ZahlenMathematische Zeitschrift, 1956
- Recursive real numbersProceedings of the American Mathematical Society, 1954
- Criteria of constructibility for real numbersThe Journal of Symbolic Logic, 1953
- Nicht konstruktiv beweisbare Sätze der AnalysisThe Journal of Symbolic Logic, 1949
- An Elementary Constructive Proof of the Fundamental Theorem of AlgebraThe American Mathematical Monthly, 1945