The efficiency of primitive recursive functions: a programmer's view

DOI10.1016/J.TCS.2015.04.022MaRDI QIDQ2355684zbMATH OpenOpenAlexFDO

Authors Armando B. Matos

Publication date 24 July 2015

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

Full work available at URL https://doi.org/10.1016/j.tcs.2015.04.022

zbMATH Keywords

complexity of loop programsoperational semanticsprimitive recursion

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Analysis of algorithms and problem complexity (68Q25) Semantics in the theory of computing (68Q55)

Recommendations

• About primitive recursive algorithms
• On the asymptotic behaviour of primitive recursive algorithms
• Decidability results for primitive recursive algorithms
• A representation theorem for primitive recursive algorithms
• On list primitive recursion and the complexity of computing inf

Cites work

• About primitive recursive algorithms
• Classical recursion theory. The theory of functions and sets of natural numbers
• Computing minimum with primitive recursion over lists
• Extending the loop language with higher-order procedural variables
• scientific article; zbMATH DE number 793950 (Why is no real title available?)
• scientific article; zbMATH DE number 3286027 (Why is no real title available?)
• scientific article; zbMATH DE number 3341976 (Why is no real title available?)
• Introduction to algorithms
• On primitive recursive algorithms and the greatest common divisor function
• On the asymptotic behaviour of primitive recursive algorithms
• On the expressive power of the loop language
• System \(T\), call-by-value and the minimum problem

Cited in

(5)

• About primitive recursive algorithms
• scientific article; zbMATH DE number 3900732 (Why is no real title available?)
• scientific article; zbMATH DE number 23837 (Why is no real title available?)
• On the asymptotic behaviour of primitive recursive algorithms
• Algorithmically expressive, always-terminating model for reversible computation

This page was built for publication: The efficiency of primitive recursive functions: a programmer's view

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