A complete characterization of primitive recursive intensional behaviours

DOI10.1051/ITA:2007053MaRDI QIDQ3514635zbMATH OpenOpenAlexFDO

Authors Pierre Valarcher

Publication date 21 July 2008

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL http://www.numdam.org/item?id=ITA_2008__42_1_69_0/, https://eudml.org/doc/92865

zbMATH Keywords

primitive recursive algorithms

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Analysis of algorithms and problem complexity (68Q25) Semantics in the theory of computing (68Q55) Analysis of algorithms (68W40)

Recommendations

• On the asymptotic behaviour of primitive recursive algorithms
• Unary primitive recursive functions
• Primitive iteration and unary functions
• scientific article; zbMATH DE number 3885887
• On Closed Classes of Primitive Recursive Functions, II

Cites work

• About primitive recursive algorithms
• Computing minimum with primitive recursion over lists
• Generating the greatest common divisor, and limitations of primitive recursive algorithms
• scientific article; zbMATH DE number 3646849 (Why is no real title available?)
• scientific article; zbMATH DE number 42059 (Why is no real title available?)
• scientific article; zbMATH DE number 55171 (Why is no real title available?)
• 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

(8)

• Decidability results for primitive recursive algorithms
• scientific article; zbMATH DE number 3557777 (Why is no real title available?)
• scientific article; zbMATH DE number 1531380 (Why is no real title available?)
• Strictly primitive recursive realizability. II: Completeness with respect to iterated reflection and a primitive recursive -rule
• On the asymptotic behaviour of primitive recursive algorithms
• Intensionality versus extensionality and primitive recursion
• Intensional aspects of function definitions
• An exactification of the monoid of primitive recursive functions

This page was built for publication: A complete characterization of primitive recursive intensional behaviours

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