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,...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Mathematical structures in computer science Jg. 30; H. 1; S. 33 - 43
Hauptverfasser: Leivant, Daniel, Marion, Jean-Yves
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Cambridge Cambridge University Press 01.01.2020
Cambridge University Press (CUP)
Schlagworte:
Computational Complexity
Computer Science
Cryptography and Security
Depletion
Iterative methods
Logic in Computer Science
ISSN:0960-1295, 1469-8072
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0960-1295
1469-8072
DOI:10.1017/S0960129519000112