scientific article
From MaRDI portal
Publication:4035315
zbMath0772.03020MaRDI QIDQ4035315
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
\(\lambda\)-calculussubrecursive hierarchycomputing over general algebraic structuressubrecurrence over free algebrastiered recurrence
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (14)
Function-algebraic characterizations of log and polylog parallel time ⋮ On parallel hierarchies and R ki ⋮ Intrinsic theories and computational complexity ⋮ Characterizing parallel time by type 2 recursions with polynomial output length ⋮ A characterization of alternating log time by ramified recurrence ⋮ A new recursion-theoretic characterization of the polytime functions ⋮ On the computational complexity of imperative programming languages ⋮ Feasible functionals and intersection of ramified types ⋮ Higher type recursion, ramification and polynomial time ⋮ Implicit characterizations of FPTIME and NC revisited ⋮ Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity ⋮ Ordinals and ordinal functions representable in the simply typed lambda calculus ⋮ \(\lambda\)-definability of free algebras ⋮ Functions over free algebras definable in the simply typed lambda calculus
This page was built for publication:
