 Mathematically, a set of mutually recursive functions are primitive recursive, which can be proven by course-of-values recursion, building a single function "F" that lists the values of the individual recursive function in order