On the asymptotic behaviour of primitive recursive algorithms

DOI10.1016/S0304-3975(00)00165-1zbMath0989.68061MaRDI QIDQ5958756

No author found.

Publication date: 3 March 2002

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

zbMATH Keywords

complexityintensionalityprimitive recursive definitions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (5)

Decidability results for primitive recursive algorithms ⋮ On primitive recursive algorithms and the greatest common divisor function ⋮ A complete characterization of primitive recursive intensional behaviours ⋮ Execution trace sets for real computation ⋮ The efficiency of primitive recursive functions: a programmer's view

Cites Work

• Computing minimum with primitive recursion over lists
• Intensional aspects of function definitions
• Sequential algorithms on concrete data structures
• About primitive recursive algorithms
• The Inf function in the system \(F\)
• Decidability results for primitive recursive algorithms
• A unary representation result for system \(T\)
• A complete characterization of primitive recursive intensional behaviours
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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