This article is cited 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.

UDC: 510.5

Received: 07.04.2003
Revised: 09.08.2006

 English version: Siberian Mathematical Journal, 2008, 49:2, 239–245

Bibliographic databases:

• 
• 
• 
• 
• 
•