- 13 Downloads
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.
Keywordspartial recursive function recursively enumerable set computable numbering e-reducibility p-reducibility
Unable to display preview. Download preview PDF.
- 2.Ershov Yu. L., Theory of Numberings. Vol. 1 [in Russian], Nauka, Moscow (1977).Google Scholar