Skip to main content
SpringerLink
Log in

Real time computation

  • Published:
Israel Journal of Mathematics Aims and scope Submit manuscript

Abstract

We introduce a concept of real-time computation by a Turing machine. The relative strengths of one-tape versus two-tape machines is established by a new method of proofs of impossibility of actual computations.

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

Similar content being viewed by others

Bibliography

  1. Hartmanis, J. and Stearns, R. E., On the computational complexity of algorithms,Trans. Amer. Math. Soc. to appear.

  2. Yamada, H., 1961, Real-time computation and recursive functions not real-time computable,IRE Trans. On Computers, EC-10, pp. 753–760.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Hebrew University of Jerusalem, Israel

    Michael O. Rabin

Authors
  1. Michael O. Rabin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research was supported in part by National Science Foundation grant GP-228 to Harvard University. This paper was written while the author was visiting at the Computation Laboratory of Harvard University during the summer of 1963.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rabin, M.O. Real time computation. Israel J. Math. 1, 203–211 (1963). https://doi.org/10.1007/BF02759719

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation