Pages that link to "Item:Q2946764"
From MaRDI portal
The following pages link to Computational Complexity Via Finite Types (Q2946764):
Displaying 13 items.
- Complexity-theoretic hierarchies induced by fragments of Gödel's \(T\) (Q1015376) (← links)
- Computations on types (Q1065543) (← links)
- On the expressive power of finitely typed and universally polymorphic recursive procedures (Q1185006) (← links)
- The complexity types of computable sets (Q1190982) (← links)
- A note on complexity measures for inductive classes in constructive type theory (Q1271558) (← links)
- Theories with self-application and computational complexity. (Q1427856) (← links)
- Towards the computational complexity of \(\mathcal{PR}^ \omega\)-terms (Q1899150) (← links)
- Uncertainty representation in dynamical systems using rough set theory (Q2077402) (← links)
- Computing in Finite Time (Q3408878) (← links)
- (Q3639069) (← links)
- An Application of Category-Theoretic Semantics to the Characterisation of Complexity Classes Using Higher-Order Function Algebras (Q4382502) (← links)
- (Q4793030) (← links)
- Logical Approaches to Computational Barriers (Q5898826) (← links)