Pages that link to "Item:Q1193623"
From MaRDI portal
The following pages link to Characterizing complexity classes by higher type primitive recursive definitions (Q1193623):
Displaying 6 items.
- Bounded combinatory logic and lower complexity (Q276270) (← links)
- Complexity-theoretic hierarchies induced by fragments of Gödel's \(T\) (Q1015376) (← links)
- Realizability models for BLL-like languages (Q1827395) (← links)
- Computational Complexity Via Finite Types (Q2946764) (← links)
- The Power of Non-determinism in Higher-Order Implicit Complexity (Q2988663) (← links)
- Recursion in Higher Types and Resource Bounded Turing Machines (Q3507448) (← links)