Mu-Recursive Function

computation

Definition

Mu-Recursive Function

A function is called mu-recursive or partially-recursive if it can be defined using primitive recursion, composition, and $\mu$-recursion.

Relation to Turing Machines

Turing, Kleene, Peter

Every computable function is partially recursive.