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

Podrobná bibliografia

Vydané v:	Mathematical structures in computer science Ročník 30; číslo 1; s. 33 - 43
Hlavní autori:	Leivant, Daniel, Marion, Jean-Yves
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Cambridge Cambridge University Press 01.01.2020 Cambridge University Press (CUP)
Predmet:	Computational Complexity Computer Science Cryptography and Security Depletion Iterative methods Logic in Computer Science
ISSN:	0960-1295, 1469-8072
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!