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

DOI10.1006/JCSS.1997.1487zbMATH Open0882.68062OpenAlexW2166160002MaRDI QIDQ1362334FDOQ1362334

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

Recommendations

• Some applications of logic to feasibility in higher types
• scientific article
• A new Characterization of Type-2 Feasibility
• Type-two polynomial-time and restricted lookahead

zbMATH Keywords

higher-order procedure

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• LCF considered as a programming language
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Classical recursion theory. Vol. II
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Functional interpretations of feasibly constructive arithmetic
• Tally languages and complexity classes
• Effective operations on partial recursive functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Polynomial and abstract subrecursive classes
• A new Characterization of Type-2 Feasibility
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• Speed-up theorems in type-2 computations using oracle Turing machines
• Type-two polynomial-time and restricted lookahead
• 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)