Imposing polynomial time complexity in functional programming
pp. 121-126
in: Arturo Carsetti (ed), Functional models of cognition, Berlin, Springer, 2000Abstract
Recursive functions are functions whose values can be effectively computed, hence they are the most interesting part, from a pragmatical point of view, of the definable functions on natural integers.