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](/_next/image?url=https%3A%2F%2Fcontent.ems.press%2Fassets%2Fpublic%2Fimages%2Fserial-issues%2Fcover-prims-volume-13-issue-2.png&w=3840&q=90)
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