arXiv (All)
open access
Step Recursion: Exact Depth Does Not Determine Algebraic Expressiveness
Step recursion is a form of bounded recursion in which each recursive call moves from an input y to a prescribed predecessor $ρ_g(y)$. Its depth $D_g(y)$ is the exact number of such moves needed to reach zero. A natural question is whether knowing this depth for every input determines the expressive
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Beyond Sequence Order: Syntax-Informed Positional Embeddings for Transformers#432586
- Ontologically Grounded Subordination#757971
- Looped Transformers under the Jacobian Lens: Does the Global Workspace Survive Recurrence?#822342
- A Semantic Framework for the Impure Logic of Ground#81070
- The Forced Operational Ordering of Logic, Sets, Types, and Categories: The Foundations of Mathematics#693648
Record · ID 1077514
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive