Primitive Recursive Functions

The main equivalence theorem states that primitive recursive functions coincide with several recurrent, continuous, and discrete dynamical computation models. Primitive recursive functions are classically generated from zero, successor, and projections using composition and primitive recursion. The equivalence suggests that composition can be internalized by bounded trajectories of fixed dynamical systems. The paper studies whether primitive recursive functions can be characterized without symbolic composition as a primitive closure rule.