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

DOI10.1006/jcss.1997.1487zbMath0882.68062OpenAlexW2166160002MaRDI QIDQ1362334

James S. Royer

Publication date: 3 August 1997

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

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)

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 ⋮ Speed-up theorems in type-2 computations using oracle Turing machines

Cites Work

• Functional interpretations of feasibly constructive arithmetic
• Polynomial and abstract subrecursive classes
• LCF considered as a programming language
• Classical recursion theory. Vol. II
• Effective operations on partial recursive functions
• Tally languages and complexity classes
• A new Characterization of Type-2 Feasibility
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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