Reduction of computable and potentially computable numerations
Matematičeskie zametki, Tome 6 (1969) no. 1, pp. 3-9
Cet article a éte moissonné depuis la source Math-Net.Ru
Among the numerations of classes of countable sets there can be distinguished those in which the number contains information about the set having the number — these are computable and potentially computable numerations — and those in which the set contains information about its number — these are covering and fully covering numerations. The conditions are established which are necessary and sufficient in order that all numerations of the given class should be covering. As a corollary it is established that there exist covering numerations which are not fully covering.
@article{MZM_1969_6_1_a0,
author = {V. A. Uspenskii},
title = {Reduction of computable and potentially computable numerations},
journal = {Matemati\v{c}eskie zametki},
pages = {3--9},
year = {1969},
volume = {6},
number = {1},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/MZM_1969_6_1_a0/}
}
V. A. Uspenskii. Reduction of computable and potentially computable numerations. Matematičeskie zametki, Tome 6 (1969) no. 1, pp. 3-9. http://geodesic.mathdoc.fr/item/MZM_1969_6_1_a0/