1954/10/01 by H. G. Rice · 4 citations
Computer Science · #Computability, Logic, AI Algorithms #Logic, programming, and type systems #Numerical Methods and Algorithms
paper · pdf · doi:10.1090/s0002-9939-1954-0063328-5
openalex publication_date 1954/10/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/03/11
A basic step in applying a new concept such as recursive functions to analysis should be an investigation of its application to the number system. We present here some of the elementary properties of recursive real numbers, as defined below. A recursive real number may be described intuitively as one for which we can effectively generate as long a decimal expansion as we wish [5], or equivalently, to which we can effectively find as close a rational approximation as we wish. Accepting the thesis of Church [1, pp. 317-323], we interpret effectiveness (or the lack of it) as meaning the existence (or nonexistence) of certain recursive functions.