scientific article; zbMATH DE number 1223632
From MaRDI portal
Publication:4218943
zbMath0910.03027MaRDI QIDQ4218943
Publication date: 19 April 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
uniform closuretype 2 functionalscomplexity theory for higher-order functionalsOracle Turing Machinepolynomial time computable functionals
Complexity of computation (including implicit computational complexity) (03D15) Turing machines and related notions (03D10) Higher-type and set recursion theory (03D65)
Related Items (4)
Theories with self-application and computational complexity. ⋮ Type-two polynomial-time and restricted lookahead ⋮ A proof-theoretic characterization of the basic feasible functionals ⋮ Parametrised second-order complexity theory with applications to the study of interval computation
This page was built for publication:
