Abstract
Using a recent result of G.Asser, an extention of Ackermann-Peter hierarchy of unary primitive recursive functions to string-functions is obtained. The resulting hierarchy classifies the string-functions according to their lexicographical growth.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
G. Asser. Rekursive Wortfunktionen Z.Math. Logik Grundlag.Math. 6(1960), 258–278.
G. Asser. Primitive recursive word-functions of one variable, in E.Borger (ed.), Computation Theory and Logic, LNCS 270, Springer 1987, 14–19.
G. Asser. Zur Robinson Charakterisierung der Einstelligen Primitiv Rekursiven Wortfunktionen, Z.Math.Logik Grundlag.Math., 34(1988), 317–322.
C. Calude. Theories of Computational Complexity, North-Holland, Amsterdam, New-York, Oxford, Tokio, 1988.
C.Calude, L.Santean. On a Theorem of Gunter Asser, Z.Math.Logik Grundlag.Math., 1990.
F.W. v.Henke, K. Indermark, G. Rose, K. Weichrauch. On Primitive Recursive Wordfunctions, Computing 15(1975), 217–234.
M.Tatarim. Darboux property and one-argument primitive recursive string-functions, Revue Roumaine des Mathematiques Pures et Appliques, 1987, 79–94.
K. Weichrauch. Teilklassen primitiv-rekursiver Wortfunktionen, Berichte der GMD 91(1974), 1–49.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Santean, L. (1990). A hierarchy of unary primitive recursive string-functions. In: Dassow, J., Kelemen, J. (eds) Aspects and Prospects of Theoretical Computer Science. IMYCS 1990. Lecture Notes in Computer Science, vol 464. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53414-8_45
Download citation
DOI: https://doi.org/10.1007/3-540-53414-8_45
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53414-3
Online ISBN: 978-3-540-46869-1
eBook Packages: Springer Book Archive