Pages that link to "Item:Q671369"
From MaRDI portal
The following pages link to Computing minimum with primitive recursion over lists (Q671369):
Displaying 9 items.
- On list primitive recursion and the complexity of computing inf (Q688724) (← links)
- About primitive recursive algorithms (Q1176246) (← links)
- System \(T\), call-by-value and the minimum problem (Q1274979) (← links)
- Decidability results for primitive recursive algorithms (Q1399975) (← links)
- The efficiency of primitive recursive functions: a programmer's view (Q2355684) (← links)
- A complete characterization of primitive recursive intensional behaviours (Q3514635) (← links)
- (Q4513599) (← links)
- On the asymptotic behaviour of primitive recursive algorithms (Q5958756) (← links)
- Theoretical computer science: computability, decidability and logic (Q6602262) (← links)