Analysis in the Computable Number Field

@article{Aberth1968AnalysisIT,
title={Analysis in the Computable Number Field},
author={Oliver Aberth},
journal={J. ACM},
year={1968},
volume={15},
pages={275-299}
}
• O. Aberth
• Published 1 April 1968
• Mathematics, Computer Science
• 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…
The prime number theorem is PRA-provable
• Olivier Sudac
• Computer Science, Mathematics
Theor. Comput. Sci.
• 2001
It is proved that several theories are conservative extensions of primitive recursive arithmetic (PRA) that are rich enough to talk about usual objects of real and complex analysis, and the axioms of which allow to recover a lot of classical results.
Computable Analysis and Differential Equations
Publisher Summary This chapter discusses the computable analysis and differential equations. Computable analysis is an analysis restricted to the field of computable numbers, where a real number is
A chain of inclusion relations in computable analysis
Introduction. Within the subfield of the reals, the computable numbers, it is possible to develop an analysis with constructive definitions for all the usual concepts: sequence, convergent sequence,
Decidability and Undecidability in the Limit
In some problems of numerical analysis or optimization, we are faced with non-convergent sequences and have to obtain information from them (for examples see  ,  ,  ,  and ).
Computational Models For Feasible Real Analysis
This expository work discusses the conventional oracle Turing machine model of recursive analysis and proposes an alternative one based on uniform Boolean circuit families. This replacement model is
Toward Abstract Numerical Analysis
• W. Miller
• Mathematics, Computer Science
JACM
• 1973
This paper deals with a technique for proving that certain problems of numerical analysis are numerically unsolvable, and the number of necessary function evaluations is taken as the measure of computational complexity.
The Concect of Effective Method Applied to Computational Problems of Linear Algebra
• O. Aberth
• Computer Science
J. Comput. Syst. Sci.
• 1971
A classification of computational problems is proposed which may have applications in numerical analysis. The classification utilizes the concept of effective method, which has been employed in
The failure in computable analysis of a classical existence theorem for differential equations
An example is given of a uniformly continuous constructive function f(x, y) withf(0, 0) = 0, such that the differential equation y' =f(x, y) with the initial condition y(0) = 0 has no constructive
Chapter 12 A bibliography of recursive analysis and recursive topology
• Computer Science
• 1998
The chapter describes some of the more recent approaches to recursive analysis, including sequence approach, filter approach, and representation approach, which provides a direct way to investigate complexity in analysis.
Beyond the universal Turing machine
• Philosophy
• 1999
We describe an emerging field, that of nonclassical computability and nonclassical computing machinery. According to the nonclassicist, the set of well-defined computations is not exhausted by the