Geodesic
How to Program an Infinite Abacus
Canadian mathematical bulletin, Tome 4 (1961) no. 3, pp. 295-302

Voir la notice de l'article provenant de la source Cambridge

DOI

This is an expository note to show how an “infinite abacus” (to be defined presently) can be programmed to compute any computable (recursive) function. Our method is probably not new, at any rate, it was suggested by the ingenious technique of Melzak [2] and may be regarded as a modification of the latter.By an infinite abacus we shall understand a countably infinite set of locations (holes, wires etc.) together with an unlimited supply of counters (pebbles, beads etc.). The locations are distinguishable, the counters are not. The confirmed finitist need not worry about these two infinitudes: To compute any given computable function only a finite number of locations will be used, and this number does not depend on the argument (or arguments) of the function. 
Lambek, Joachim. How to Program an Infinite Abacus. Canadian mathematical bulletin, Tome 4 (1961) no. 3, pp. 295-302. doi: 10.4153/CMB-1961-032-6
@article{10_4153_CMB_1961_032_6,
     author = {Lambek, Joachim},
     title = {How to {Program} an {Infinite} {Abacus}},
     journal = {Canadian mathematical bulletin},
     pages = {295--302},
     year = {1961},
     volume = {4},
     number = {3},
     doi = {10.4153/CMB-1961-032-6},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1961-032-6/}
}
TY  - JOUR
AU  - Lambek, Joachim
TI  - How to Program an Infinite Abacus
JO  - Canadian mathematical bulletin
PY  - 1961
SP  - 295
EP  - 302
VL  - 4
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1961-032-6/
DO  - 10.4153/CMB-1961-032-6
ID  - 10_4153_CMB_1961_032_6
ER  - 
%0 Journal Article
%A Lambek, Joachim
%T How to Program an Infinite Abacus
%J Canadian mathematical bulletin
%D 1961
%P 295-302
%V 4
%N 3
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1961-032-6/
%R 10.4153/CMB-1961-032-6
%F 10_4153_CMB_1961_032_6

Cité par Sources :