Pages that link to "Item:Q3291527"
From MaRDI portal
The following pages link to Classifications of Recursive Functions by Means of Hierarchies (Q3291527):
Displaying 10 items.
- Complexity of algorithms and computations (Q1153141) (← links)
- Augmented loop languages and classes of computable functions (Q1219687) (← links)
- An operator embedding theorem for complexity classes of recursive functions (Q1225934) (← links)
- The intrinsic difficulty of recursive functions (Q1919986) (← links)
- Complexity Hierarchies beyond Elementary (Q2828216) (← links)
- P.R.-Regulated Systems of Notation and the Subrecursive Hierarchy Equivalence Property (Q4140975) (← links)
- Recursive Pseudo-Well-Orderings (Q5579489) (← links)
- Non-uniqueness at ω2 in Kleene'sO (Q5586298) (← links)
- Hierarchies of number-theoretic functions. I (Q5612466) (← links)
- Strictly primitive recursive realizability. II: Completeness with respect to iterated reflection and a primitive recursive \(\omega\)-rule (Q5937826) (← links)
