Pages that link to "Item:Q1176246"
From MaRDI portal
The following pages link to About primitive recursive algorithms (Q1176246):
Displaying 18 items.
- Computing minimum with primitive recursion over lists (Q671369) (← links)
- Intensional aspects of function definitions (Q673180) (← links)
- On list primitive recursion and the complexity of computing inf (Q688724) (← links)
- System \(T\), call-by-value and the minimum problem (Q1274979) (← links)
- Decidability results for primitive recursive algorithms (Q1399975) (← links)
- On primitive recursive algorithms and the greatest common divisor function (Q1399976) (← links)
- A unary representation result for system \(T\) (Q1817075) (← links)
- The efficiency of primitive recursive functions: a programmer's view (Q2355684) (← links)
- On the proof-theoretic foundation of general definition theory (Q2500816) (← links)
- Execution trace sets for real computation (Q2699944) (← links)
- A representation theorem for primitive recursive algorithms (Q2895767) (← links)
- A complete characterization of primitive recursive intensional behaviours (Q3514635) (← links)
- A Macro Program for the Primitive Recursive Functions (Q3982860) (← links)
- (Q4513599) (← links)
- Iterating on multiple collections in synchrony (Q5101923) (← links)
- On the asymptotic behaviour of primitive recursive algorithms (Q5958756) (← links)
- Intensionality versus extensionality and primitive recursion (Q6560359) (← links)
- Theoretical computer science: computability, decidability and logic (Q6602262) (← links)
