The following pages link to New Computational Paradigms (Q5717048):
Displaying 7 items.
- Non-determinism in Gödel's system \(T\) (Q693050) (← links)
- Complexity-theoretic hierarchies induced by fragments of Gödel's \(T\) (Q1015376) (← links)
- Characterizing polynomial and exponential complexity classes in elementary lambda-calculus (Q1640981) (← links)
- A Characterisation of the Relations Definable in Presburger Arithmetic (Q3502652) (← links)
- Pure Iteration and Periodicity (Q3507417) (← links)
- Recursion in Higher Types and Resource Bounded Turing Machines (Q3507448) (← links)
- Logical Approaches to Computational Barriers (Q5898826) (← links)