20 citations · 86 across the 16 of their papers we have counts for
1 paper · 1 filter
Bruce M. Kapron, Florian Steinberg
This paper provides an alternate characterization of type-two polynomial-time computability, with the goal of making second-order complexity theory more approachable. We rely on th…