Complexity of primitive recursion
From MaRDI portal
Recommendations
Cited in
(20)- The realm of primitive recursion
- About primitive recursive algorithms
- Elementary arithmetic
- An analog characterization of the Grzegorczyk hierarchy
- On some generalizations of the primitive recursive arithmetic
- A new order-theoretic characterisation of the polytime computable functions
- scientific article; zbMATH DE number 4134024 (Why is no real title available?)
- scientific article; zbMATH DE number 5117088 (Why is no real title available?)
- Undecidable complexity statements in -arithmetic
- Predicative Analysis of Feasibility and Diagonalization
- A lexicographic path order with slow growing derivation bounds
- scientific article; zbMATH DE number 1834639 (Why is no real title available?)
- Complexity analysis of precedence terminating infinite graph rewrite systems
- Pointers in recursion: exploring the tropics
- Do we need recursion?
- Primitive recursion in the abstract
- Primitive recursion and \(\mu\)-recursivity
- Recursion and proofs
- New Computational Paradigms
- On list primitive recursion and the complexity of computing inf
This page was built for publication: Complexity of primitive recursion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4263838)
