Israel Journal of Mathematics

, Volume 1, Issue 4, pp 203–211 | Cite as

Real time computation

  • Michael O. Rabin


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.


Input Sequence Turing Machine Recursive Function Finite Automaton Atomic Move 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Hartmanis, J. and Stearns, R. E., On the computational complexity of algorithms,Trans. Amer. Math. Soc. to appear.Google Scholar
  2. 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

Copyright information

© Hebrew University 1963

Authors and Affiliations

  • Michael O. Rabin
    • 1
  1. 1.The Hebrew University of JerusalemIsrael

Personalised recommendations