Unbounded minimization ($\mu$)

For a partial function $g(\mathbf{x},y)$, unbounded minimization definesas the least $y$ at which $g$ is zero, provided the preceding required computations are defined. If no such $y$ is found, $f(\mathbf{x})$ is undefined. Closing the primitive recursive functions under this operation gives the partial recursive functions.