The following pages link to (Q4035315):
Displaying 11 items.
- \(\lambda\)-definability of free algebras (Q803116) (← links)
- Implicit characterizations of FPTIME and NC revisited (Q1044672) (← links)
- A new recursion-theoretic characterization of the polytime functions (Q1207333) (← links)
- Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity (Q1295429) (← links)
- Ordinals and ordinal functions representable in the simply typed lambda calculus (Q1302304) (← links)
- Functions over free algebras definable in the simply typed lambda calculus (Q1314357) (← links)
- Function-algebraic characterizations of log and polylog parallel time (Q1332666) (← links)
- Higher type recursion, ramification and polynomial time (Q1577477) (← links)
- On the computational complexity of imperative programming languages (Q1827396) (← links)
- A characterization of alternating log time by ramified recurrence (Q1978645) (← links)
- Feasible functionals and intersection of ramified types (Q2842842) (← links)
