Decidability results for primitive recursive algorithms

DOI10.1016/S0304-3975(02)00732-6zbMath1026.03028OpenAlexW1984134415MaRDI QIDQ1399975

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

tracedecidabilityprimitive recursionmutal recursionobstination theoremprimitive recursive combinator

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items (1)

On the asymptotic behaviour of primitive recursive algorithms

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\)
• A unary representation result for system \(T\)
• A complete characterization of primitive recursive intensional behaviours
• On the asymptotic behaviour of primitive recursive algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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