There are two different classical concepts of relative effective computability in Ordinary Recursion Theory (cf. [5,7]), namely µ-recursiveness and partial recursiveness. The latter can be described either (i) as µ-recursiveness in a certain multiple-valued function, say U = λs.{2s, 2S+1}, or (ii) as existentially quantified primitive recursiveness.