A new Characterization of Type-2 Feasibility

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Recursive functions and relations, subrecursive hierarchies (03D20) Higher-type and set recursion theory (03D65)

Cited In (33)

Feasible Iteration of Feasible Learning Functionals
Speed-up theorems in type-2 computations using oracle Turing machines
Exact real computation of solution operators for linear analytic systems of partial differential equations
Type-two polynomial-time and restricted lookahead
Semantics, specification logic, and Hoare logic of exact real computation
Parametrised second-order complexity theory with applications to the study of interval computation
Characterizing polynomial time complexity of stream programs using interpretations
Game semantics approach to higher-order complexity
Representations and evaluation strategies for feasibly approximable functions
The basic feasible functionals in computable analysis
Elementary explicit types and polynomial time operations
A foundational delineation of poly-time
Semantics vs syntax vs computations: Machine models for type-2 polynomial-time bounded functionals
Towards Computational Complexity Theory on Advanced Function Spaces in Analysis
Resource restricted computability theoretic learning: Illustrative topics and problems
Two algorithms in search of a type-system
Axiomatizing Resource Bounds for Measure
Polynomial Running Times for Polynomial-Time Oracle Machines
On the Versatility of Open Logical Relations
A tight relationship between generic oracles and type-2 complexity theory
Title not available (Why is that?)
Safe Weak Minimization Revisited
On basic feasible functionals and the interpretation method
A proof-theoretic characterization of the basic feasible functionals
Quantitative continuity and Computable Analysis in Coq
Feasible functionals and intersection of ramified types
Title not available (Why is that?)
A Relationship between Equilogical Spaces and Type Two Effectivity
Theories with self-application and computational complexity.
Title not available (Why is that?)
Title not available (Why is that?)
Quantitative coding and complexity theory of compact metric spaces
Feasible computability and resource bounded topology

This page was built for publication: A new Characterization of Type-2 Feasibility

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