Improved simulation of nondeterministic Turing machines

12 years 6 months ago

Download www.cc.gatech.edu

Abstract. The standard simulation of a nondeterministic Turing machine (NTM) by a deterministic one essentially searches a large boundeddegree graph whose size is exponential in the running time of the NTM. The graph is the natural one deﬁned by the conﬁgurations of the NTM. All methods in the literature have required time linear in the size

Subrahmanyam Kalyanasundaram, Richard J. Lipton, K

Real-time Traffic

Nondeterministic Turing Machine | Simulation Method | TCS 2012 | Theoretical Computer Science | Time Dependence |

claim paper

» On the Computational Power of Neural Nets

» Nonconfluence in divisionless P systems with active membranes

» TimeSpace Tradeoffs for Satisfiability

» Observability of Turing Machines A Refinement of the Theory of Computation

» Paraconsistent Machines and their Relation to Quantum Computing

» Continuous Petri Nets Expressive Power and Decidability Issues

» The Methods of Approximation and Lifting in Real Computation

» Asynchronous Spiking Neural P Systems Decidability and Undecidability

Post Info
More Details (n/a)

Added	25 Apr 2012
Updated	25 Apr 2012
Type	Journal
Year	2012
Where	TCS
Authors	Subrahmanyam Kalyanasundaram, Richard J. Lipton, Kenneth W. Regan, Farbod Shokrieh

Comments (0)

Sciweavers

Improved simulation of nondeterministic Turing machines

Nondeterministic Turing Machine | Simulation Method | TCS 2012 | Theoretical Computer Science | Time Dependence |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers