Computational complexity of multitape Turing machines and random access machines

DOI10.2977/PRIMS/1195189815MaRDI QIDQ1249434zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• scientific article; zbMATH DE number 3403734 (Why is no real title available?)
• Counter machines and counter languages
• On Languages Accepted in Polynomial Time
• Time bounded random access machines
• Time- and tape-bounded Turing acceptors and AFLs

Cited in

(1)

• A characterization of time complexity by simple loop programs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1249434)