The following pages link to (Q4934292):
Displayed 27 items.
- A proof-theoretic characterization of the basic feasible functionals (Q706620) (← links)
- Unbounded recursion and non-size-increasing functions (Q737105) (← links)
- Complexity-theoretic hierarchies induced by fragments of Gödel's \(T\) (Q1015376) (← links)
- A foundation for real recursive function theory (Q1032628) (← links)
- Implicit characterizations of FPTIME and NC revisited (Q1044672) (← links)
- Theories with self-application and computational complexity. (Q1427856) (← links)
- Continuous-time computation with restricted integration capabilities (Q1434373) (← links)
- Safe recursion with higher types and BCK-algebra (Q1577481) (← links)
- A survey of recursive analysis and Moore's notion of real computation (Q1761708) (← links)
- Computations on counter machines with summator (Q1789205) (← links)
- Separating NC along the \(\delta\) axis (Q1827390) (← links)
- On the computational complexity of imperative programming languages (Q1827396) (← links)
- An analog characterization of the Grzegorczyk hierarchy (Q1872639) (← links)
- A characterization of alternating log time by ramified recurrence (Q1978645) (← links)
- Bounded monotone recursion and multihead automata (Q2017762) (← links)
- A characterization of polynomial time computable functions from the integers to the reals using discrete ordinary differential equations (Q2104133) (← links)
- Arithmetization of register machines with counters (Q2212730) (← links)
- Applicative theories for logarithmic complexity classes (Q2346995) (← links)
- A feasible theory of truth over combinatory algebra (Q2637706) (← links)
- Complexity Hierarchies beyond Elementary (Q2828216) (← links)
- The Power of Non-determinism in Higher-Order Implicit Complexity (Q2988663) (← links)
- A Characterisation of the Relations Definable in Presburger Arithmetic (Q3502652) (← links)
- Pure Iteration and Periodicity (Q3507417) (← links)
- New substitution bases for complexity classes (Q5112387) (← links)
- Unfolding Schematic Systems (Q5214786) (← links)
- On the coincidence of complexity classes BPC and \(\text{TC}^0 \) (Q6043894) (← links)
- A characterization of functions over the integers computable in polynomial time using discrete ordinary differential equations (Q6116835) (← links)