The set of recursive functions is the smallest set which contains the initial functions and is closed with respect to composition, primitive recursion, and minimalization.
If we exclude minimalization from this construction, we get the set of primitive recursive functions, all of which are total functions. Minimalization is the only operator which introduces partial functions (or, from a computational standpoint, non-termination).