Real Number Computability and Domain Theory

We propose a possible implementation, using lazy functional programming, of the exact computation on real numbers. Using domain theory we can analyze this kind of computation and give a definition of computability for the functions on the real number. This definition turns out to be equivalent to other definitions given in the literature using different methods.

[1]  Dana S. Scott,et al.  Data Types as Lattices , 1976, SIAM J. Comput..

[2]  Robert Cartwright,et al.  Exact real arithmetic formulating real numbers as functions , 1990 .

[3]  A. Turing.  On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[4]  Hans-J. Boehm.  Constructive real interpretation of numerical programs , 1987, PLDI 1987.

[5]  H. G. Rice,et al.  Recursive real numbers , 1954 .

[6]  M. Beeson.  Foundations of Constructive Mathematics , 1985 .

[7]  Oliver Aberth,et al.  Computable analysis , 1980 .

[8]  Hans-Juergen Boehm,et al.  Exact real arithmetic: a case study in higher order programming , 1986, LFP '86.

[9]  L.E.J. Brouwer.  1924 D – Mathematics. – “Beweis, dass jede volle Funktion gleichmässig stetig ist” , 1975 .

[10]  Ker-I Ko,et al.  Computational Complexity of Real Functions , 1982, Theor. Comput. Sci..

[11]  Jean Vuillemin,et al.  Exact real computer arithmetic with continued fractions , 1988, IEEE Trans. Computers.

[12]  A. Grzegorczyk.  On the definitions of computable real continuous functions , 1957 .

[13]  Michael B. Smyth,et al.  Effectively given Domains , 1977, Theor. Comput. Sci..

[14]  Klaus Weihrauch,et al.  Embedding Metric Spaces Into CPO's , 1981, Theor. Comput. Sci..

[15]  John Myhill,et al.  What Is a Real Number , 1972 .

[16]  E. Wiedmer,et al.  Computing with Infinite Objects , 1980, Theor. Comput. Sci..

[17]  Christoph Kreitz,et al.  Representations of the real numbers and of the open subsets of the set of real numbers , 1987, Ann. Pure Appl. Log..