On the asymptotic behaviour of primitive recursive algorithms

DOI10.1016/S0304-3975(00)00165-1MaRDI QIDQ5958756zbMATH OpenFDO

Authors René David

Publication date 3 March 2002

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-3975(00)00165-1

zbMATH Keywords

complexityintensionalityprimitive recursive definitions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Decidability results for primitive recursive algorithms
• Primitive program algebras. II
• scientific article; zbMATH DE number 55171
• The efficiency of primitive recursive functions: a programmer's view
• A complete characterization of primitive recursive intensional behaviours

Cites work

• A complete characterization of primitive recursive intensional behaviours
• A unary representation result for system \(T\)
• About primitive recursive algorithms
• Computing minimum with primitive recursion over lists
• Decidability results for primitive recursive algorithms
• scientific article; zbMATH DE number 4087627 (Why is no real title available?)
• scientific article; zbMATH DE number 55171 (Why is no real title available?)
• scientific article; zbMATH DE number 1229489 (Why is no real title available?)
• scientific article; zbMATH DE number 559098 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Intensional aspects of function definitions
• Sequential algorithms on concrete data structures
• The Inf function in the system \(F\)

Cited in

(10)

• Decidability results for primitive recursive algorithms
• On primitive recursive algorithms and the greatest common divisor function
• Remarks on the \(\mathrm A^{\ast\ast}\) algorithm
• The efficiency of primitive recursive functions: a programmer's view
• Execution trace sets for real computation
• A representation theorem for primitive recursive algorithms
• A complete characterization of primitive recursive intensional behaviours
• scientific article; zbMATH DE number 55171 (Why is no real title available?)
• Intensionality versus extensionality and primitive recursion
• The New French School of Philosophy of Computing

This page was built for publication: On the asymptotic behaviour of primitive recursive algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5958756)