Rogers semilattices of punctual numberings

The paper works within the framework of punctual computability, which is focused on eliminating unbounded search from constructions in algebra and infinite combinatorics. We study punctual numberings, that is, uniform computations for families S of primitive recursive functions. The punctual reducib...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Mathematical structures in computer science Jg. 32; H. 2; S. 164 - 188
Hauptverfasser:	Bazhenov, Nikolay, Mustafa, Manat, Ospichev, Sergei
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Cambridge, UK Cambridge University Press 01.02.2022
Schlagworte:	Algorithms Combinatorial analysis Recursive functions Special Issue: Theory and Applications of Models of Computation (TAMC 2020) primitive recursion decidability Friedberg numbering online computation Theory of numberings punctual structure upper semilattice Rogers semilattice
ISSN:	0960-1295, 1469-8072
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!