JournalsprimsVol. 13, No. 2pp. 469–496

Computational Complexity of Multitape Turing Machines and Random Access Machines

  • Takumi Kasai

    Kyoto University, Japan
Computational Complexity of Multitape Turing Machines and Random Access Machines cover
Download PDF

Cite this article

Takumi Kasai, Computational Complexity of Multitape Turing Machines and Random Access Machines. Publ. Res. Inst. Math. Sci. 13 (1977), no. 2, pp. 469–496

DOI 10.2977/PRIMS/1195189815