|
This article is cited in 2 scientific papers (total in 2 papers)
Reduction of computable and potentially computable numerations
V. A. Uspenskii M. V. Lomonosov Moscow State University
Abstract:
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.
Received: 10.06.1968
Citation:
V. A. Uspenskii, “Reduction of computable and potentially computable numerations”, Mat. Zametki, 6:1 (1969), 3–9; Math. Notes, 6:1 (1969), 461–464
Linking options:
https://www.mathnet.ru/eng/mzm6891 https://www.mathnet.ru/eng/mzm/v6/i1/p3
|
Statistics & downloads: |
Abstract page: | 398 | Full-text PDF : | 159 | First page: | 1 |
|