Computational complexity of multitape Turing machines and random access machines

DOI10.2977/prims/1195189815zbMath0385.68047OpenAlexW2050120811MaRDI QIDQ1249434

Takumi Kasai

Publication date: 1977

Published in: Publications of the Research Institute for Mathematical Sciences, Kyoto University (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2977/prims/1195189815

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Turing machines and related notions (03D10)

Related Items (1)

A characterization of time complexity by simple loop programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Time bounded random access machines
• Time- and tape-bounded Turing acceptors and AFLs
• Counter machines and counter languages
• On Languages Accepted in Polynomial Time

This page was built for publication: Computational complexity of multitape Turing machines and random access machines