Decidability results for primitive recursive algorithms

DOI10.1016/S0304-3975(02)00732-6MaRDI QIDQ1399975zbMATH OpenOpenAlexFDO

Authors D. Massart

Publication date 30 July 2003

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

Full work available at URL https://doi.org/10.1016/s0304-3975(02)00732-6

zbMATH Keywords

decidabilitytraceprimitive recursionmutal recursionobstination theoremprimitive recursive combinator

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20)

Recommendations

• On the asymptotic behaviour of primitive recursive algorithms
• scientific article; zbMATH DE number 55171
• A representation theorem for primitive recursive algorithms
• scientific article; zbMATH DE number 559098
• On list primitive recursion and the complexity of computing inf

Cites work

• 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?)
• 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
• Intensional aspects of function definitions
• On the asymptotic behaviour of primitive recursive algorithms
• Sequential algorithms on concrete data structures
• The Inf function in the system \(F\)

Cited in

(8)

• On the asymptotic behaviour of primitive recursive algorithms
• scientific article; zbMATH DE number 55171 (Why is no real title available?)
• The efficiency of primitive recursive functions: a programmer's view
• scientific article; zbMATH DE number 1916517 (Why is no real title available?)
• The decidable properties of subrecursive functions
• A representation theorem for primitive recursive algorithms
• Decidability and complexity analysis by basic paramodulation
• Decidable problems for powerful programs

This page was built for publication: Decidability results for primitive recursive algorithms

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