Primitive recursion in the 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,...

Full description

Saved in:
Bibliographic Details
Published in:Mathematical structures in computer science Vol. 30; no. 1; pp. 33 - 43
Main Authors: Leivant, Daniel, Marion, Jean-Yves
Format: Journal Article
Language:English
Published: Cambridge Cambridge University Press 01.01.2020
Cambridge University Press (CUP)
Subjects:
Computational Complexity
Computer Science
Cryptography and Security
Depletion
Iterative methods
Logic in Computer Science
ISSN:0960-1295, 1469-8072
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0960-1295
1469-8072
DOI:10.1017/S0960129519000112