Primitive recursion admits equivalent characterizations via bounded ReLU iteration, robust polynomial ODEs, and step-size-parameterized polynomial maps, with composition emerging from the dynamics.
XX:26 Primitive Recursion without Composition 25 Daniel Silva Graça and José Félix Costa
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Primitive Recursion without Composition: Dynamical Characterizations, from Neural Networks to Polynomial ODEs
Primitive recursion admits equivalent characterizations via bounded ReLU iteration, robust polynomial ODEs, and step-size-parameterized polynomial maps, with composition emerging from the dynamics.