 Other results show that the class \(\mathbf{PR}\) also remains stable if primitive recursion is replaced with other schemes which may initially appear more general. The most familiar of these is the scheme of course of values recursion which is traditionally illustrated using the so-called Fibonacci function \(\fib(x)\) which was briefly discussed at the beginning of  Section 1.  This may be defined as follows: 