Analysis in the Computable Number Field

  title={Analysis in the Computable Number Field},
  author={Oliver Aberth},
  journal={J. ACM},
  • O. Aberth
  • Published 1 April 1968
  • 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… 

Tables from this paper

The prime number theorem is PRA-provable
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 [23] , [24] , [26] , [30] and [37]).
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
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 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
Beyond the universal Turing machine
An emerging field is described, that of nonclassical computability and non classical computing machinery, and a philosophical defence of its foundations is provided.


Recursive real numbers
This work presents here some of the elementary properties of recursive real numbers, as defined below, which may be described intuitively as one for which the authors can effectively generate as long a decimal expansion as they wish.
Criteria of Constructibility for Real Numbers
The purpose of this paper is to prove two theorems and a conjecture (Conjecture II) announced in section 15 an earlier paper of the author's (cited as “ CT ”), and to compare them briefly with
Nicht Konstruktiv Beweisbare Satze Der Analysis
  • E. Specker
  • Mathematics, Computer Science
    J. Symb. Log.
  • 1949
Nach allgemeiner Ueberzeugung konnen gewisse Satze der Analysis nicht konstruktiv bewiesen werden.
Konstr2~ktive Analysis. Deutsche Verlag der Wissensehaften
  • Konstr2~ktive Analysis. Deutsche Verlag der Wissensehaften
  • 1961
Recursive Analysis. North-II
  • Recursive Analysis. North-II
  • 1961
Der Satz vom Maximum in der rekursive Analysis. Constructivity in Mathematics
  • Der Satz vom Maximum in der rekursive Analysis. Constructivity in Mathematics
  • 1959
On computable numbers , with au application to the Entseheidungs prob
  • Proc . Lond . Math . Soc .
  • 1959
Comp~tability and Un,~olvability. Me(ir,.tw-Hill
  • Comp~tability and Un,~olvability. Me(ir,.tw-Hill
  • 1958
On constructive functions
  • Trudy Mat. Inst. b,~. Steklova
  • 1958