Computing minimum with primitive recursion over lists

DOI10.1016/0304-3975(95)00243-XMaRDI QIDQ671369zbMATH OpenFDO

Authors Daniel Fredholm

Publication date 27 February 1997

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

Full work available at URL https://doi.org/10.1016/0304-3975(95)00243-X

zbMATH Keywords

call-by-value evaluation orderlists of natural numbersprimitive recursive algorithm

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On list primitive recursion and the complexity of computing inf
• scientific article; zbMATH DE number 559098
• About primitive recursive algorithms

Cites work

• About primitive recursive algorithms
• scientific article; zbMATH DE number 559098 (Why is no real title available?)
• Intensional aspects of function definitions

Cited in

(10)

• About primitive recursive algorithms
• System \(T\), call-by-value and the minimum problem
• Decidability results for primitive recursive algorithms
• The efficiency of primitive recursive functions: a programmer's view
• A complete characterization of primitive recursive intensional behaviours
• scientific article; zbMATH DE number 559098 (Why is no real title available?)
• scientific article; zbMATH DE number 1531380 (Why is no real title available?)
• On the asymptotic behaviour of primitive recursive algorithms
• Theoretical computer science: computability, decidability and logic
• On list primitive recursion and the complexity of computing inf

This page was built for publication: Computing minimum with primitive recursion over lists

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