scientific article; zbMATH DE number 806755

MaRDI QIDQ4850556zbMATH OpenFDO

Authors Anil K. Seth

Publication date 2 May 1996

zbMATH Keywords

feasible functionalshigher type functionalsoracle Turing machine

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Higher-type and set recursion theory (03D65) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Some applications of logic to feasibility in higher types
• scientific article; zbMATH DE number 1223632
• A new Characterization of Type-2 Feasibility
• scientific article; zbMATH DE number 65741

Cited in

(10)

• A note on complexity measures for inductive classes in constructive type theory
• Semantics vs syntax vs computations: Machine models for type-2 polynomial-time bounded functionals
• Characterizing polynomial time complexity of stream programs using interpretations
• Game semantics approach to higher-order complexity
• Feasible functionals and intersection of ramified types
• scientific article; zbMATH DE number 3521955 (Why is no real title available?)
• scientific article; zbMATH DE number 1223632 (Why is no real title available?)
• Some applications of logic to feasibility in higher types
• Computation models and function algebras
• Type 2 polynomial hierarchies

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4850556)