On \(R\)-universal functions (Q2577367)

A partial recursive function \(\alpha\) is called \(R\)-universal, if \(R\) is a recursively enumerable set, the range of \(\alpha\) equals \(R\), and the range of \(\beta\) \(\subseteq R\) implies \(\beta\leq_m\alpha\) for any partial recursive function \(\beta\), where \(\beta\leq_m\alpha\) means \(\beta=\alpha f\) for some recursive function \(f\). This paper gives some properties of \(R\)-universal functions. For example, it is proven that the \(\rho\)-resemblance type of an \(R\)-universal function, \(R\) being not the empty set or the set of all natural numbers, consists of one isomorphism type, but of more than one \(\rho\)-recursive isomorphism types.