Computing minimum with primitive recursion over lists

DOI10.1016/0304-3975(95)00243-XzbMATH Open0874.68146MaRDI QIDQ671369FDOQ671369

Authors: Daniel Fredholm 

Publication date: 27 February 1997

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

Recommendations

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• About primitive recursive algorithms
• Title not available (Why is that?)
• Intensional aspects of function definitions

Cited In (9)

• About primitive recursive algorithms
• On list primitive recursion and the complexity of computing inf
• Decidability results for primitive recursive algorithms
• The efficiency of primitive recursive functions: a programmer's view
• Theoretical computer science: computability, decidability and logic
• A complete characterization of primitive recursive intensional behaviours
• System \(T\), call-by-value and the minimum problem
• Title not available (Why is that?)
• On the asymptotic behaviour of primitive recursive algorithms

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)