Skip to main content
SpringerLink
Log in

Bounded recursion and complexity classes

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1979 (MFCS 1979)

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

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

9. References

  1. Ritchis, R.W., Classes of predictably computable functions, Trans. Amer. Math. Soc. 106 (1963), 137–173.

    Google Scholar 

  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. Thompson, D.B., Subrecursiveness: Machine-Independent Notions of Computability in Restricted Time and Storage, MST 6 (1972), 3–15.

    Google Scholar 

  4. Monien, B., A recursive and a grammatical characterization of the exponentional-time languages, TCS 3 (1977), 61–74.

    Article  Google Scholar 

  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. Constable, Robert.L., Type two computational complexity, Proc. of 5th Ann. ACM Symp. on Theory of Comp., 1973, 108–121.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sektion Mathematik der Friedrich-Schiller-Universität, Universitätschochhaus, DDR - 69, Jena

    Klaus Wagner

Authors
  1. Klaus Wagner
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jiří Bečvář

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation