Article contents
Primitive recursion in the abstract
Published online by Cambridge University Press: 21 January 2020
Abstract
Recurrence can be used as a function definition schema for any nontrivial free algebra, yielding the same computational complexity in all cases. We show that primitive-recursive computing is in fact independent of free algebras altogether, and can be characterized by a generic programming principle, namely the control of iteration by the depletion of finite components of the underlying structure.
- Type
- Paper
- Information
- Copyright
- © Cambridge University Press 2020
References
- 2
- Cited by