An Informal Arithmetical Approach to Computability and Computation, III
Canadian mathematical bulletin, Tome 9 (1966) no. 5, pp. 593-609
Voir la notice de l'article provenant de la source Cambridge
It is assumed that the reader is acquainted with the first two parts of the present paper, [1] and [2], in which there was developed informally the theory of a certain class of hypothetical computing devices, the Q-machines. In the present part of the paper we develop a way of describing Q-programs and Q-computations; then, following the theorem in [2], we obtain some further connections between the arithmetical nature of a number x and the computational schémas for generating sequences of rational numbers converging to x; and finally, by means of the usual device of Goedel numbering we begin to examine some properties of programs which operate on programs.
An Informal Arithmetical Approach to Computability and Computation, III. Canadian mathematical bulletin, Tome 9 (1966) no. 5, pp. 593-609. doi: 10.4153/CMB-1966-073-6
@misc{10_4153_CMB_1966_073_6,
title = {An {Informal} {Arithmetical} {Approach} to {Computability} and {Computation,} {III}},
journal = {Canadian mathematical bulletin},
pages = {593--609},
year = {1966},
volume = {9},
number = {5},
doi = {10.4153/CMB-1966-073-6},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1966-073-6/}
}
Cité par Sources :