Preview
Unable to display preview. Download preview PDF.
9. References
Ritchis, R.W., Classes of predictably computable functions, Trans. Amer. Math. Soc. 106 (1963), 137–173.
Cobham, A., The intrinsic computational complexity of functions, Proc. 1964 Intern. Congr. on Logic, Math. and Philos. of Science, 24–30.
Thompson, D.B., Subrecursiveness: Machine-Independent Notions of Computability in Restricted Time and Storage, MST 6 (1972), 3–15.
Monien, B., A recursive and a grammatical characterization of the exponentional-time languages, TCS 3 (1977), 61–74.
Monien, B., Komplexitätsklassen von Automatenmodellen und beschränkte Rekursion, Bericht Nr. 8, Institut für Informatik, Universität Hamburg, 1974.
Constable, Robert.L., Type two computational complexity, Proc. of 5th Ann. ACM Symp. on Theory of Comp., 1973, 108–121.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wagner, K. (1979). Bounded recursion and complexity classes. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1979. MFCS 1979. Lecture Notes in Computer Science, vol 74. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09526-8_49
Download citation
DOI: https://doi.org/10.1007/3-540-09526-8_49
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09526-2
Online ISBN: 978-3-540-35088-0
eBook Packages: Springer Book Archive