A representation theorem for primitive recursive algorithms
From MaRDI portal
Recommendations
- Decidability results for primitive recursive algorithms
- On the asymptotic behaviour of primitive recursive algorithms
- A proof-theoretic account of primitive recursion and primitive iteration
- On the Algebraic Structure of Primitive Recursive Functions
- Primitive recursive equivalence relations and their primitive recursive complexity
- About primitive recursive algorithms
- On some generalizations of the primitive recursive arithmetic
- scientific article; zbMATH DE number 3966062
- On rudimentarity, primitive recursivity and representability
- Primitive recursion and \(\mu\)-recursivity
Cited in
(11)- About primitive recursive algorithms
- An affine representation of de Casteljau's and de Boor's rational algorithms
- Primitive recursion in the abstract
- Remarks on the \(\mathrm A^{\ast\ast}\) algorithm
- Classes of algorithms: formalization and comparison
- Decidability results for primitive recursive algorithms
- The efficiency of primitive recursive functions: a programmer's view
- A total functional programming language computing APRA
- Algorithmically expressive, always-terminating model for reversible computation
- A Macro Program for the Primitive Recursive Functions
- An imperative language characterizing PTIME algorithms
This page was built for publication: A representation theorem for primitive recursive algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2895767)
