Repository | Book | Chapter
Imposing polynomial time complexity in functional programming
pp. 121-126
Abstract
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.
Publication details
Published in:
Carsetti Arturo (2000) Functional models of cognition: self-organizing dynamics and semantic structures in cognitive systems. Dordrecht, Springer.
Pages: 121-126
DOI: 10.1007/978-94-015-9620-6_8
Full citation:
Böhm Corrado (2000) „Imposing polynomial time complexity in functional programming“, In: A. Carsetti (ed.), Functional models of cognition, Dordrecht, Springer, 121–126.