An Informal Arithmetical Approach to Computability and Computation
Canadian mathematical bulletin, Tome 4 (1961) no. 3, pp. 279-293
Voir la notice de l'article provenant de la source Cambridge
In 1936 A. M. Turing published his analysis of the notion of effective computability. Very roughly speaking, its object was to distinguish between numbers defined by existential statements and those defined by purely constructive ones. Guided by his schematizing of what goes on when a person calculates using paper and pencil, Turing introduced the concept of an A-machine, eventually to be called a Turing machine. Such a machine consists of a box and a linear tape divided into squares, indefinitely long in both directions. The tape passes through the box and exactly one square of it is always within the box. The system changes only at certain discrete times: t = 0, 1, .... Each square can carry exactly one of the finite set of symbols: s1, s2, ..., sn, one of which may be the blank.
Melzak, Z.A. An Informal Arithmetical Approach to Computability and Computation. Canadian mathematical bulletin, Tome 4 (1961) no. 3, pp. 279-293. doi: 10.4153/CMB-1961-031-9
@article{10_4153_CMB_1961_031_9,
author = {Melzak, Z.A.},
title = {An {Informal} {Arithmetical} {Approach} to {Computability} and {Computation}},
journal = {Canadian mathematical bulletin},
pages = {279--293},
year = {1961},
volume = {4},
number = {3},
doi = {10.4153/CMB-1961-031-9},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1961-031-9/}
}
TY - JOUR AU - Melzak, Z.A. TI - An Informal Arithmetical Approach to Computability and Computation JO - Canadian mathematical bulletin PY - 1961 SP - 279 EP - 293 VL - 4 IS - 3 UR - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1961-031-9/ DO - 10.4153/CMB-1961-031-9 ID - 10_4153_CMB_1961_031_9 ER -
Cité par Sources :