Analysis in the Computable Number Field

@article{Aberth1968AnalysisIT,
  title={Analysis in the Computable Number Field},
  author={O. Aberth},
  journal={J. ACM},
  year={1968},
  volume={15},
  pages={275-299}
}
  • O. Aberth
  • Published 1968
  • Computer Science, Mathematics
  • J. ACM
  • 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… CONTINUE READING
    21 Citations

    Tables and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    The prime number theorem is PRA-provable
    • Olivier Sudac
    • Computer Science, Mathematics
    • Theor. Comput. Sci.
    • 2001
    • 2
    • PDF
    Computable Analysis and Differential Equations
    • 22
    A chain of inclusion relations in computable analysis
    • 3
    • PDF
    Decidability and Undecidability in the Limit
    Computational Models For Feasible Real Analysis
    • 4
    Toward Abstract Numerical Analysis
    • 3
    The Concect of Effective Method Applied to Computational Problems of Linear Algebra
    • O. Aberth
    • Computer Science
    • J. Comput. Syst. Sci.
    • 1971
    • 6
    Beyond the universal Turing machine
    • 91