Hostname: page-component-78c5997874-t5tsf Total loading time: 0 Render date: 2024-11-09T19:47:22.417Z Has data issue: false hasContentIssue false

An Informal Arithmetical Approach to Computability and Computation, III

Published online by Cambridge University Press:  20 November 2018

Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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.

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1966

References

1. Melzak, Z.A., Canad. Math. Bull., vol. 4, no. 3, Sept. 1961, pages 279-293.Google Scholar
2. Melzak, Z.A., Canad. Math. Bull., vol. 7, no. 2, April 1964, pages 183-200.Google Scholar
3. Schneider, T., Einfuehrung in die transzendenten Zahlen. Springer, 1957.Google Scholar