Skip to main navigation Skip to search Skip to main content

Improved simulation of nondeterministic Turing machines

  • Subrahmanyam Kalyanasundaram
  • , Richard J. Lipton
  • , Kenneth W. Regan
  • , Farbod Shokrieh
  • Georgia Institute of Technology

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

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 Õ(√S). The search savings exploit the one-dimensional nature of Turing machine tapes. In addition, we remove most of the time-dependence on nondeterministic choice of states and tape head movements.

Original languageEnglish
Title of host publicationMathematical Foundations of Computer Science 2010 - 35th International Symposium, MFCS 2010, Proceedings
Pages453-464
Number of pages12
DOIs
StatePublished - 2010
Event35th International Symposium on Mathematical Foundations of Computer Science, MFCS 2010 - Brno, Czech Republic
Duration: Aug 23 2010Aug 27 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6281 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference35th International Symposium on Mathematical Foundations of Computer Science, MFCS 2010
Country/TerritoryCzech Republic
CityBrno
Period08/23/1008/27/10

Fingerprint

Dive into the research topics of 'Improved simulation of nondeterministic Turing machines'. Together they form a unique fingerprint.

Cite this