This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Literature
S. Eilenberg, C. Elgot, Recursiveness, Academic Press, New York and London, 1970
A. Grzegorczyk, Some classes of recursive functions, Rozprawy Matematyczne, Warszawa 1953
F.W. von Henke, K. Indermark, K. Weihrauch, Primitive recursice wordfunctions, Automata, Languages and Programming — Proceedings of a symposium organized by IRIA, North-Holland Publishing Company, Amsterdam, London, 1973
H. Huwig, Beziehungen zwischen beschränkter syntaktischer und beschränkter primitiver Rekursion, Universität Dortmund, Dissertation 1976
H. Kopp, Programmierung von Funktionen, Berichtsreihe der Abteilung Informatik der Universität des Saarlandes
H. Müller, Klassifizierungen der primitiv-rekursiven Funktionen, Dissertation, 1974
C.P. Schnorr, Rekursive Funktionen und ihre Komplexität, Teubner Studienbücher, Stuttgart 1974
D.B. Thompson, Subrecursiveness: Machine-Independent Notions of Computability in Restricted Time and Storage, Mathematical Systems Theory, Vol. 6, No. 1, Springer-Verlag, New York, 1972
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1976 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Huwig, H. (1976). A machine independent description of complexity classes, definable by nondeterministic as well as deterministic turing machines with primitiv recursive tape or time bounds. In: Mazurkiewicz, A. (eds) Mathematical Foundations of Computer Science 1976. MFCS 1976. Lecture Notes in Computer Science, vol 45. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07854-1_197
Download citation
DOI: https://doi.org/10.1007/3-540-07854-1_197
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07854-8
Online ISBN: 978-3-540-38169-3
eBook Packages: Springer Book Archive