Pages that link to "Item:Q1219687"
From MaRDI portal
The following pages link to Augmented loop languages and classes of computable functions (Q1219687):
Displaying 11 items.
- Streamlined subrecursive degree theory (Q408165) (← links)
- Honest elementary degrees and degrees of relative provability without the cupping property (Q515565) (← links)
- On a complexity-based way of constructivizing the recursive functions (Q922528) (← links)
- An operator embedding theorem for complexity classes of recursive functions (Q1225934) (← links)
- Polynomial and abstract subrecursive classes (Q1227276) (← links)
- On the density of honest subrecursive classes (Q1229713) (← links)
- On computational reducibility (Q1232281) (← links)
- On languages specified by relative acceptance (Q1249438) (← links)
- On the computational complexity of imperative programming languages (Q1827396) (← links)
- Relativization of the Theory of Computational Complexity (Q4124321) (← links)
- Semi-honest subrecursive degrees and the collection rule in arithmetic (Q6137350) (← links)
