A~method of presenting the theory of algorithms and enumerable sets
Informatics and Automation, Problems of the constructive direction in mathematics. Part 3, Tome 72 (1964), pp. 69-98
Voir la notice de l'article provenant de la source Math-Net.Ru
@article{TRSPY_1964_72_a3,
author = {G. S. Tseitin},
title = {A~method of presenting the theory of algorithms and enumerable sets},
journal = {Informatics and Automation},
pages = {69--98},
publisher = {mathdoc},
volume = {72},
year = {1964},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/TRSPY_1964_72_a3/}
}
G. S. Tseitin. A~method of presenting the theory of algorithms and enumerable sets. Informatics and Automation, Problems of the constructive direction in mathematics. Part 3, Tome 72 (1964), pp. 69-98. http://geodesic.mathdoc.fr/item/TRSPY_1964_72_a3/