A method of presenting the theory of algorithms and enumerable sets
Trudy Matematicheskogo Instituta imeni V.A. Steklova, Problems of the constructive direction in mathematics. Part 3, Tome 72 (1964), pp. 69-98
Cet article a éte moissonné depuis la source Math-Net.Ru
@article{TM_1964_72_a3,
author = {G. S. Tseitin},
title = {A~method of presenting the theory of algorithms and enumerable sets},
journal = {Trudy Matematicheskogo Instituta imeni V.A. Steklova},
pages = {69--98},
year = {1964},
volume = {72},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/TM_1964_72_a3/}
}
G. S. Tseitin. A method of presenting the theory of algorithms and enumerable sets. Trudy Matematicheskogo Instituta imeni V.A. Steklova, Problems of the constructive direction in mathematics. Part 3, Tome 72 (1964), pp. 69-98. http://geodesic.mathdoc.fr/item/TM_1964_72_a3/