Metraipolis › archive › dc_fe4b07aec285
Step Recursion: Resource Profiles and Descent Quotients — arXiv:2608.22662
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.22662
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T09:17:43.466Z
- SHA-256 of the archived text
a37316e14a5e08a51d69a9fbfc35ced191ba021d8bfed4ea04e8387293a45a8d- Stable URL of this page
https://metraipolis.com/documento/dc_fe4b07aec285
How to cite
Step Recursion: Resource Profiles and Descent Quotients — arXiv:2608.22662 — arXiv (en), https://arxiv.org/abs/2608.22662 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fe4b07aec285 (Metraipolis archive dc_fe4b07aec285, sha256 a37316e14a5e08a51d69a9fbfc35ced191ba021d8bfed4ea04e8387293a45a8d)
BibTeX
@misc{dcfe4b07aec285,
title = {Step Recursion: Resource Profiles and Descent Quotients — arXiv:2608.22662},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.22662},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fe4b07aec285; sha256 a37316e14a5e08a51d69a9fbfc35ced191ba021d8bfed4ea04e8387293a45a8d},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.22662. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We develop a resource representation for step recursion in which mutable-state width and recursion descent are explicit and independent parameters. A width bound $u$ controls the size of the encoded machine state, while an effective descent $\rho$ determines the available recursion depth $\delta_\rho(u)$. For generalized-inverse descents, we derive the depth directly from generator growth and characterize the increasing sequences that can occur as generator orbits. We then connect this depth--width geometry to standard finite-branching computation. Every deterministic bounded-state dynamics is realizable by a single ordinary bounded step recursion over a fixed finite numerical basis. Using deterministic, existential, universal, or alternating aggregation on the same local dynamics yields the corresponding machine semantics. After closure under the width reparameterizations needed to absorb fixed local cost, the resulting language classes are exactly the machine time--space classes on profiles $(\delta_\rho(u),u)$. Finally, profile domination quotients effective descents by admissible width reparameterization. Some depth curves collapse, yet polynomial widths support an explicit infinite strict hierarchy between the canonical polynomial- and exponential-depth profiles. Thus descent remains a nonredundant resource coordinate after polynomial width reparameterization; standard complexity classes are calibration points. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-25 in cs.CC). Categorie arXiv: Computational Complexity (cs.CC) ; Logic in Computer Science (cs.LO). Pagina del lavoro: https://arxiv.org/abs/2608.22662 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-18T09:17:26.759Z dalla pagina https://arxiv.org/catchup/cs.CC/2026-08-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).