  Define the primitive recursive functions to be the smallest class of functions that contains the Initial functions and is closed under Composition and Primitive Recursion. The set of primitive recursive functions is equal to the set of functions computed using bounded iteration (Meyer &amp; Ritchie 1967), i.e. the set of functions definable in the language Bloop from (Hofstadter 1979).