Pages that link to "Item:Q5659521"
From MaRDI portal
The following pages link to A Classification of the Recursive Functions (Q5659521):
Displaying 18 items.
- Streamlined subrecursive degree theory (Q408165) (← links)
- Honest elementary degrees and degrees of relative provability without the cupping property (Q515565) (← links)
- Cook reducibility is faster than Karp reducibility in NP (Q751812) (← links)
- Data representation and computational complexity (Q1132872) (← links)
- A maximal sequence of classes transformable by primitive recursion in a given class (Q1147129) (← links)
- Complexity of algorithms and computations (Q1153141) (← links)
- On the computational power of automata with time or space bounded by Ackermann's or superexponential functions (Q1159662) (← links)
- Augmented loop languages and classes of computable functions (Q1219687) (← links)
- On primitive recursive wordfunctions (Q1221752) (← links)
- Polynomial and abstract subrecursive classes (Q1227276) (← links)
- On the density of honest subrecursive classes (Q1229713) (← links)
- Nonexistence of program optimizers in several abstract settings (Q1231391) (← links)
- On computational reducibility (Q1232281) (← links)
- The structure of the honest polynomial m-degrees (Q1341316) (← links)
- The intrinsic difficulty of recursive functions (Q1919986) (← links)
- Relativization of the Theory of Computational Complexity (Q4124321) (← links)
- ON SHAVRUKOV’S NON-ISOMORPHISM THEOREM FOR DIAGONALIZABLE ALGEBRAS (Q6131232) (← links)
- Semi-honest subrecursive degrees and the collection rule in arithmetic (Q6137350) (← links)
