On Basic Feasible Functionals and the Interpretation Method

The class of basic feasible functionals (BFF) is the analog of FP (polynomial time functions) for type-2 functionals, that is, functionals that can take (first-order) functions as arguments. BFF can be defined through Oracle Turing machines with running time bounded by second-order polynomials. On t...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Baillot, Patrick, Dal Lago, Ugo, Kop, Cynthia, Vale, Deivid
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Computer Science
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!