112
click to vote
APAL
2000
15 years 2 months ago
2000
It is shown how to restrict recursion on notation in all finite types so as to characterize the polynomial time computable functions. The restrictions are obtained by using a rami...