Relationships between nondeterministic and deterministic tape complexities

J. Comput. Syst. Sci., no. 2 (1970): 177-192

引用982|浏览22
EI
下载 PDF 全文
引用

摘要

The amount of storage needed to simulate a nondeterministic tape bounded Turingmachine on a deterministic Turing machine is investigated. Results include the following: Theorem. A nondeterministic L(n)-tape bounded Turing machine can be simulated by a deterministic [L(n)]^2-tape bounded Turing machine, provided L(n)=log"2n. Computations o...更多

代码

数据

0
您的评分 :

暂无评分

标签
评论
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn