|
Sibirskii Matematicheskii Zhurnal, 2008, Volume 49, Number 2, Pages 299–307
(Mi smj1841)
|
|
|
|
This article is cited in 5 scientific papers (total in 5 papers)
$e$-principal numberings
A. N. Degtev, M. L. Platonov Tyumen State University
Abstract:
We prove the existence of the computable families of finite sets and general recursive functions with no $e$-principal numbering. We give a series of examples of $e$-degrees such that the $p$-degrees of their computable numberings include no top $p$-degree.
Keywords:
partial recursive function, recursively enumerable set, computable numbering, $e$-reducibility, $p$-reducibility.
Received: 07.04.2003 Revised: 09.08.2006
Citation:
A. N. Degtev, M. L. Platonov, “$e$-principal numberings”, Sibirsk. Mat. Zh., 49:2 (2008), 299–307; Siberian Math. J., 49:2 (2008), 239–245
Linking options:
https://www.mathnet.ru/eng/smj1841 https://www.mathnet.ru/eng/smj/v49/i2/p299
|
Statistics & downloads: |
Abstract page: | 278 | Full-text PDF : | 131 | References: | 38 | First page: | 1 |
|