Other equivalent function classes are the λ-recursive functions and the functions that can be computed by Markov algorithms.

- If
*f*(*x*,*z*_{1},*z*_{2},...,*z*_{n}) is a partial function on the natural numbers with*n*+1 arguments*x*,*z*_{1},...,*z*_{n}, then the function μ*x**f*is the partial function with arguments*z*_{1},...,*z*_{n}that returns the least*x*such that*f*(0,*z*_{1},*z*_{2},...,*z*_{n}),*f*(1,*z*_{1},*z*_{2},...,*z*_{n}), ...,*f*(*x*,*z*_{1},*z*_{2},...,*z*_{n}) are all defined and*f*(*x*,*z*_{1},*z*_{2},...,*z*_{n}) = 0, if such an*x*exists; if no such*x*exists, then μ*x**f*is not defined for the particular arguments*z*_{1},...,*z*_{n}.

The set of *partial recursive functions* is defined as the smallest set of partial functions of any arity from natural numbers to natural numbers which contains the zero, successor, and projection functions, and which is closed under composition, primitive recursion, and unbounded search.

The set of *total recursive functions* is the subset of partial recursive functions which are total.

In the equivalence of models of computability the parallel is drawn between Turing machines which do not terminate for certain inputs and an undefined result for that input in the corresponding partial recursive function. The unbounded search operator is not definable by the rules of primitive recursion as those do not provide a mechanism for "infinite loops" (undefined values).

It is interesting to note that if the application of the unbounded search operator in the definition above is limited strictly to *regular functions* (functions which are guaranteed to be total when the unbounded search operator is applied to them), the resulting set (historically called the *general recursive functions*) is the same as the set of recursive functions -- in other words, the requirement for partial functions can be partially obviated.