Skip to main content
SpringerLink
Log in

Subrecursiveness: Machine-independent notions of computability in restricted time and storage

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. J. H. Bennett,On Spectra, Thesis, Princeton, 1962.

    Google Scholar 

  2. A. Cobham, The intrinsic computational complexity of functions,Proc. 1964 International Congress on Logic, Methodology and Philosophy of Science, pp. 24–30, North-Holland, Amsterdam, 1965.

    Google Scholar 

  3. M. J. Fischer andA. L. Rosenberg, Turing machines with reset operations,Notices Amer. Math. Soc., p. 845, 67T-629, 1967.

  4. A. Grzegorczyk, Some classes of recursive functions,Rozprawy Matematyczne, No. 4, 1953.

  5. J. Hartmanis, P. M. Lewis II, andR. E. Stearns, Hierarchies on memory limited computations, IEEE Conf. Record on Switching Circuit Theory and Logical Design, 1965, pp. 179–190, Ann Arbor, Michigan.

    Google Scholar 

  6. F. C. Hennie, One-tape, off-line Turing machine computations,Information and Control 8 (1965), 553–578.

    Google Scholar 

  7. F. C. Hennie andR. E. Stearns, Two-tape simulation of multitape Turing machines,J. Assoc. Comp. Mach. 13 (1966), 533–546.

    Google Scholar 

  8. J. E. Hopcroft andJ. D. Ullman, Formal Languages and their relation to automata, Addison Wesley, Reading, Mass., 1969.

    Google Scholar 

  9. S. C. Kleene,Introduction to Metamathematics, Van Nostrand, New York, 1952.

    Google Scholar 

  10. G. Kreisel, Recursive, subrecursive, metarecursive, Rome Air Development Center and Hughes-Fullerton TP 66-11-22, 1965.

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

    Google Scholar 

  12. H. Rogers,Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967.

    Google Scholar 

  13. Raymond M. Smullyan,Theory of Formal Systems, Annals of Math. Studies, No. 47, Princeton Univ. Press, Princeton, 1961.

    Google Scholar 

  14. D. B. Thompson,Subrecursiveness and Finite Computers, Thesis, Stanford, 1968.

    Google Scholar 

  15. D. B. Thompson, On the complexity of finite functions, in preparation.

Download references

Author information

Authors and Affiliations

  1. State University of New York at Buffalo, USA

    David B. Thompson

Authors
  1. David B. Thompson
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Thompson, D.B. Subrecursiveness: Machine-independent notions of computability in restricted time and storage. Math. Systems Theory 6, 3–15 (1972). https://doi.org/10.1007/BF01706069

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01706069

Keywords

Search

Navigation