Bounded recursion and complexity classes

  • Klaus Wagner
Part of the Lecture Notes in Computer Science book series (LNCS, volume 74)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

9. References

  1. 1.
    Ritchis, R.W., Classes of predictably computable functions, Trans. Amer. Math. Soc. 106 (1963), 137–173.Google Scholar
  2. 2.
    Cobham, A., The intrinsic computational complexity of functions, Proc. 1964 Intern. Congr. on Logic, Math. and Philos. of Science, 24–30.Google Scholar
  3. 3.
    Thompson, D.B., Subrecursiveness: Machine-Independent Notions of Computability in Restricted Time and Storage, MST 6 (1972), 3–15.Google Scholar
  4. 4.
    Monien, B., A recursive and a grammatical characterization of the exponentional-time languages, TCS 3 (1977), 61–74.CrossRefGoogle Scholar
  5. 5.
    Monien, B., Komplexitätsklassen von Automatenmodellen und beschränkte Rekursion, Bericht Nr. 8, Institut für Informatik, Universität Hamburg, 1974.Google Scholar
  6. 6.
    Constable, Robert.L., Type two computational complexity, Proc. of 5th Ann. ACM Symp. on Theory of Comp., 1973, 108–121.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • Klaus Wagner
    • 1
  1. 1.Sektion Mathematik der Friedrich-Schiller-UniversitätJena

Personalised recommendations