alphaFeedback

WorksComputer Science

Step Recursion: Exact Membership Spectra, Mixed Strides, and Collapse

Abstract

For a strictly increasing G:N→NG:\mathbb{N}\to\mathbb{N} with G(0)≥1G(0)\geq 1, we study minimal-basis function algebras generated by recursion along generalized inverses of its iterates. Bounded recursion requires an earlier pointwise majorant; unbounded recursion has no such requirement. If the orbit G[t](0)G^{[t]}(0) has no polynomial upper bound, we obtain exact fixed-function membership spectra, reverse-divisibility inclusion, and indexed intersections that need not be single-stride algebras. Every finite divisibility-downset is realized in both regimes, and mixed strides admit fixed functions expressing any finite monotone Boolean condition on their additive stride monoid. For every generator, the realized bounded spectra form a bounded meet-semilattice: a construction sharing a bounding input coordinate realizes finite intersections without an unrestricted selector. Polynomial orbit growth is equivalent to definability of each of ordinary predecessor, unary doubling, and addition in any fixed unbounded stride algebra. In this case the algebra is ordinary primitive recursion relative to its inverse map, giving full collapse for primitive-recursive GG. Ordinary predecessor belongs to a bounded stride algebra exactly when the orbit is polynomially bounded and GG has bounded successive differences; equivalently, ordinary bounded recursion embeds. A locality obstruction explains the additional bounded requirement, and two primitive-recursive generators with quadratic orbits have opposite bounded collapse behavior.

Paper details

vlnc:W_wze57an5
v1 · latestHistory (1)

published · Fresh — added to the Hub within the last 30 days

added ·

Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

arXiv nonexclusive license

Original source

  • Computer Science

ChatGPT (OpenAI) · View statement →

Looking for related papers…