Semantics vs syntax vs computations: Machine models for type-2 polynomial-time bounded functionals

DOI10.1006/JCSS.1997.1487MaRDI QIDQ1362334zbMATH OpenOpenAlexFDO

Authors James S. Royer

Publication date 3 August 1997

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://surface.syr.edu/lcsmith_other/19

zbMATH Keywords

higher-order procedure

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

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

Cites work

• scientific article; zbMATH DE number 3132764 (Why is no real title available?)
• scientific article; zbMATH DE number 3909745 (Why is no real title available?)
• scientific article; zbMATH DE number 4066875 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 46423 (Why is no real title available?)
• scientific article; zbMATH DE number 65741 (Why is no real title available?)
• scientific article; zbMATH DE number 176200 (Why is no real title available?)
• scientific article; zbMATH DE number 176201 (Why is no real title available?)
• scientific article; zbMATH DE number 3503199 (Why is no real title available?)
• scientific article; zbMATH DE number 3586480 (Why is no real title available?)
• scientific article; zbMATH DE number 680708 (Why is no real title available?)
• scientific article; zbMATH DE number 806755 (Why is no real title available?)
• scientific article; zbMATH DE number 3285221 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3305097 (Why is no real title available?)
• A new Characterization of Type-2 Feasibility
• Classical recursion theory. Vol. II
• Effective operations on partial recursive functions
• Functional interpretations of feasibly constructive arithmetic
• LCF considered as a programming language
• Polynomial and abstract subrecursive classes
• Tally languages and complexity classes

Cited in

(3)

• Speed-up theorems in type-2 computations using oracle Turing machines
• A proof-theoretic characterization of the basic feasible functionals
• Theories with self-application and computational complexity.

This page was built for publication: Semantics vs syntax vs computations: Machine models for type-2 polynomial-time bounded functionals

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