31 citations · 92 across the 14 of their papers we have counts for
1 paper · 2 filters
Norman Danner, James S. Royer
We exhibit a sound and complete implicit-complexity formalism for functions feasibly computable by structural recursions over inductively defined data structures. Feasibly computab…