An iterative description of the class $\varepsilon^1$ of Grzegorczyk's hierarchy
Zapiski Nauchnykh Seminarov POMI, Studies in constructive mathematics and mathematical logic. Part VII, Tome 60 (1976), pp. 3-14
Voir la notice de l'article provenant de la source Math-Net.Ru
A class of abstract computing machines is described. It is proved that the class of all functions computable by these machines coincides with the class $\varepsilon^1$ of Grzegorczyk's hierarchy.
@article{ZNSL_1976_60_a0,
author = {A. P. Beltiukov},
title = {An iterative description of the class $\varepsilon^1$ of {Grzegorczyk's} hierarchy},
journal = {Zapiski Nauchnykh Seminarov POMI},
pages = {3--14},
publisher = {mathdoc},
volume = {60},
year = {1976},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZNSL_1976_60_a0/}
}
A. P. Beltiukov. An iterative description of the class $\varepsilon^1$ of Grzegorczyk's hierarchy. Zapiski Nauchnykh Seminarov POMI, Studies in constructive mathematics and mathematical logic. Part VII, Tome 60 (1976), pp. 3-14. http://geodesic.mathdoc.fr/item/ZNSL_1976_60_a0/