 Most recursive expressions found in common usage (i.e.not pathological) can be shown to terminate through various means, usually depending on the definition of the expression itself.As an example, the function argument in the recursive expression for the factorial function below will always decrease by 1; by the well-ordering property of natural numbers, the argument will eventually reach 1 and the recursion will terminate.