Skip to main content
SpringerLink
Log in

On restricted turing computability

  • 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. Hartmanis andR. E. Stearns, On the computational complexity of algorithms,Trans. Amer. Math. Soc. 117 (1965) 285–306.

    Google Scholar 

  2. A. M. Turing, On computable numbers, with applications to the Entscheidungsproblem,Proc. London Math. Soc. (2)42 (1934) 230–265.

    Google Scholar 

  3. H. Hermes,Enumerability, Decidability, Computability, Springer-Verlag, Berlin-Göttingen-Heidelberg, 1965.

    Google Scholar 

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

    Google Scholar 

  5. S. S. Ruby andP. C. Fischer, Translational methods and computational complexity,Proc. IEEE Sixth Annual Conf. on Switching Theory and Automata, pp. 173–178, 1965.

  6. P. C. Fischer, Turing machines with a schedule to keep,Information and Control 11 (1967), 138–146.

    Google Scholar 

  7. R. E. Stearns, J. Hartmanis andP. M. Lewis, Hierarchies of memory limited computations,Proc. IEEE Sixth Annual Conf. on Switching Theory and Automata, pp. 179–190, 1965.

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

    Google Scholar 

  9. J. Hartmanis, Computational complexity of one-tape Turing machine computations,J. Assoc. Comput. Mach. 15 (1968), 325–339.

    Google Scholar 

  10. M. Blum, A machine-independent theory of the complexity of recursive functions,J. Assoc. Comput. Mach. 14 (1967), 322–336.

    Google Scholar 

  11. A. Meyer andP. C. Fischer, On computational speed-up,Proc. IEEE Ninth Annual Conf. on Switching Theory and Automata, pp. 351–355, 1968.

  12. J. E. Hopcroft andJ. D. Ullman, Relations between time and tape complexities,J. Assoc. Comput. Mach. 15 (1968), 414–427.

    Google Scholar 

  13. E. P. Glinert, On multitape Turing machines with restriction conditions, M.Sc. Thesis (Hebrew with English synopsis), Technion, Israel Institute of Technology, Haifa, 1969.

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, Hebrew University, Jerusalem, Israel

    Ephraim P. Glinert

Authors
  1. Ephraim P. Glinert
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

The work reported in this paper is part of the author's Thesis, written under the supervision of Prof. A. Ginzburg, for the degree of M.Sc. in Mathematics at the Technion, Israel Institute of Technology, Haifa.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Glinert, E.P. On restricted turing computability. Math. Systems Theory 5, 331–343 (1971). https://doi.org/10.1007/BF01694077

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation