|
This article is cited in 3 scientific papers (total in 3 papers)
Existence of families without positive numerations
S. S. Marchenkov Keldysh Applied Mathematics Institute, Academy of Sciences of the USSR
Abstract:
An example is constructed of a computable family of recursively enumerable sets which does not have computable positive numerations but does possess a computable minimal numeration.
Received: 31.07.1972
Citation:
S. S. Marchenkov, “Existence of families without positive numerations”, Mat. Zametki, 13:4 (1973), 597–604; Math. Notes, 13:4 (1973), 360–363
Linking options:
https://www.mathnet.ru/eng/mzm7161 https://www.mathnet.ru/eng/mzm/v13/i4/p597
|
Statistics & downloads: |
Abstract page: | 188 | Full-text PDF : | 81 | First page: | 1 |
|