Improved simulation of nondeterministic Turing machines

被引：1

作者：

Kalyanasundaram, Subrahmanyam ^{[1
]}

Lipton, Richard J. ^{[1
]}

Regan, Kenneth W. ^{[2
]}

Shokrieh, Farbod ^{[3
]}

机构：

[1] Georgia Tech, Coll Comp, Atlanta, GA 30332 USA

[2] SUNY Buffalo, Dept Comp Sci & Engn, Buffalo, NY 14260 USA

[3] Georgia Tech, Sch Elect & Comp Engn, Atlanta, GA 30332 USA

来源：

THEORETICAL COMPUTER SCIENCE | 2012年 / 417卷

关键词：

Turing machines; Nondeterminism; Determinism; Simulation; Complexity; Algorithms; TIME;

D O I：

10.1016/j.tcs.2011.05.018

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The standard simulation of a nondeterministic Turing machine (NTM) by a deterministic one essentially searches a large bounded-degree graph whose size is exponential in the running time of the NTM. The graph is the natural one defined by the configurations of the NTM. All methods in the literature have required time linear in the size S of this graph. This paper presents a new simulation method that runs in time (O) over tilde(root S). The search savings exploit the one-dimensional nature of Turing machine tapes. In addition, we remove most of the time dependence on nondeterministic choices of states and tape head movements. Published by Elsevier B.V.

引用

下载

页码：66 / 73

页数：8

共 50 条

[11] Optimal simulation of two-dimensional alternating finite automata by three-way nondeterministic turing machines
Yamaguchi Univ, Ube, Japan
Theor Comput Sci, 1 (123-135):
[12] Total Nondeterministic Turing Machines and a p-optimal Proof System for SAT
Sadowski, Zenon
UNVEILING DYNAMICS AND COMPLEXITY, CIE 2017, 2017, 10307 : 364 - 374
[13] A NOTE ON MULTI-INKDOT NONDETERMINISTIC TURING-MACHINES WITH SMALL SPACE
INOUE, K
ITO, A
TAKANAMI, I
YOSHINAGA, T
INFORMATION PROCESSING LETTERS, 1993, 48 (06) : 285 - 288
[14] OPTIMAL SIMULATION OF 2-DIMENSIONAL ALTERNATING FINITE AUTOMATA BY 3-WAY NONDETERMINISTIC TURING-MACHINES
ITO, A
INOUE, K
TAKANAMI, I
WANG, Y
THEORETICAL COMPUTER SCIENCE, 1995, 143 (01) : 123 - 135
[15] RELATIONS AMONG SIMULTANEOUS COMPLEXITY CLASSES OF NONDETERMINISTIC AND ALTERNATING TURING-MACHINES
IWATA, S
KASAI, T
MORIYA, E
ACTA INFORMATICA, 1993, 30 (03) : 267 - 278
[16] UNIFORM SIMULATIONS OF NONDETERMINISTIC REAL-TIME MULTITAPE TURING-MACHINES
BRANDENBURG, FJ
BRANDSTADT, A
WAGNER, KW
MATHEMATICAL SYSTEMS THEORY, 1987, 19 (04): : 277 - 299
[17] AN INTROSPECT OF SIMULATION OF NONDETERMINISTIC TURING MACHINE WITH A REAL-ANALYTIC FUNCTION
Piekarz, Monika
APLIMAT 2009: 8TH INTERNATIONAL CONFERENCE, PROCEEDINGS, 2009, : 627 - 633
[18] Non-closure Properties of 1-Inkdot Nondeterministic Turing Machines and Alternating Turing Machines with Only Universal States Using Small Space
Yoshinaga, Tsunehiro
Xu, Jianliang
Sakamoto, Makoto
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2010, E93A (06) : 1148 - 1152
[19] 2-TAPE SIMULATION OF TURING MACHINES
STOSS, HJ
COMPUTING, 1971, 7 (3-4) : 222 - +
[20] Uniform simulation of Turing machines by cellular automata
Goles, E
Matamala, M
CELLULAR AUTOMATA AND COMPLEX SYSTEMS, 1999, 3 : 23 - 36

← 1 2 3 4 5 →