Journal of the ACM · 1968 · 26 citations · 4 references
ComputingComputer ScienceMathematicsNumber TheorySet TheoryTheory Of ComputationComputability TheoryNumber-theoretic AlgorithmsComputabilityComputable NumbersCountable Set
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.
4
H. G. Rice · Proceedings of the American Mathematical Society · 1954 · 157 citations · Full text
Andrzej Mostowski · Fundamenta Mathematicae · 1957 · 62 citations · Full text
Criteria of constructibility for real numbers
John Myhill · Journal of Symbolic Logic · 1953 · 37 citations