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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Mathematical structures in computer science Ročník 30; číslo 1; s. 33 - 43
Hlavní autoři: Leivant, Daniel, Marion, Jean-Yves
Médium: Journal Article
Jazyk:angličtina
Vydáno: Cambridge Cambridge University Press 01.01.2020
Cambridge University Press (CUP)
Témata:
Computational Complexity
Computer Science
Cryptography and Security
Depletion
Iterative methods
Logic in Computer Science
ISSN:0960-1295, 1469-8072
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0960-1295
1469-8072
DOI:10.1017/S0960129519000112