Primitive Recursive Functions
Cross-source consensus on Primitive Recursive Functions from 1 sources and 4 claims.
1 sources · 4 claims
Uses
How it works
Comparisons
Background
Highlighted claims
- The main equivalence theorem states that primitive recursive functions coincide with several recurrent, continuous, and discrete dynamical computation models. — Primitive Recursion without Composition: Dynamical Characterizations, from Neural Networks to Polynomial ODEs
- The paper studies whether primitive recursive functions can be characterized without symbolic composition as a primitive closure rule. — Primitive Recursion without Composition: Dynamical Characterizations, from Neural Networks to Polynomial ODEs
- Primitive recursive functions are classically generated from zero, successor, and projections using composition and primitive recursion. — Primitive Recursion without Composition: Dynamical Characterizations, from Neural Networks to Polynomial ODEs
- The equivalence suggests that composition can be internalized by bounded trajectories of fixed dynamical systems. — Primitive Recursion without Composition: Dynamical Characterizations, from Neural Networks to Polynomial ODEs