On characterizations of the basic feasible functionals, Part I
From MaRDI portal
Publication:2740989
DOI10.1017/S0956796800003841zbMath0992.68020OpenAlexW1980256844MaRDI QIDQ2740989
James S. Royer, Robert J. Irwin, Bruce M. Kapron
Publication date: 11 September 2002
Published in: Journal of Functional Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0956796800003841
Related Items (14)
Game semantics approach to higher-order complexity ⋮ Complete and tractable machine-independent characterizations of second-order polytime ⋮ Feasible Iteration of Feasible Learning Functionals ⋮ Theories with self-application and computational complexity. ⋮ Type-two polynomial-time and restricted lookahead ⋮ A proof-theoretic characterization of the basic feasible functionals ⋮ Unnamed Item ⋮ Parametrised second-order complexity theory with applications to the study of interval computation ⋮ Resource restricted computability theoretic learning: Illustrative topics and problems ⋮ Axiomatizing Resource Bounds for Measure ⋮ On the computational complexity of Longley's \(H\) functional ⋮ Unnamed Item ⋮ Feasible functionals and intersection of ramified types ⋮ Characterizing polynomial time complexity of stream programs using interpretations
This page was built for publication: On characterizations of the basic feasible functionals, Part I
