Symmetric Turing machine

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Definition of Symmetric Turing machines[edit]

A Symmetric TM is a TM which has a configuration graph that is undirected. That is configuration i yields configuration j if and only if j yields i. The set of languages that have a symmetric TM deciding it in log space is called SL. It was first defined in 1982 by Lewis and Papadimitriou,[1][2] who were looking for a class in which to place USTCON, which until this time could, at best, be placed only in NL, despite seeming not to require nondeterminism. They defined the symmetric Turing machine, used it to define SL. Symmetric Turing machines are kind of Turing machines with limited nondeterministic power. Informally Symmetric computations are reversible in an approximate manner. A symmetric computation is divided into locally deterministic sub computation (segments) between special configuration, where nondeterminism takes place, such that the only special configuration reached from a backward computation is the special configuration started the segment. Thus the segments are locally deterministic in its forward direction and have limited nondeterminism in its backward direction. Also if there is a way from special configuration A1 to special configuration A2, there must be a way back from A2 to A1.

Example of Symmetric Configuration

Symmetric log space complexity[edit]

  • SSPACE(S(n)) is the class of the languages accepted by a symmetric Turing machine running in space O(S(n))
  • SL is the class of problems solvable by a nondeterministic Turing machine in logarithmic space, such that
    1. If the answer is 'yes,' one or more computation paths accept.
    2. If the answer is 'no,' all paths reject.
    3. If the machine can make a nondeterministic transition from configuration A to configuration B, then it can also transition from B to A. (This is what 'symmetric' means.)
    4. It was proved that SL = CoSL.

Idea about why USTCON is SL-complete[edit]

The most important Complete Problem is the USTCON, Lewis and Papadimitriou by their definition showed that USTCON is complete for SL class. They constructed a nondeterministic machine for USTCON, and they made a lemma for converting this machine into Symmetric Turing Machine. Then the theorem follows as any language can be accepted using a symmetric Turing machine is logspace reducible to USTCON as from the properties of the symmetric computation we can view the special configuration as the undirected edges of the graph.

Notes[edit]

  1. ^ Jesper Jansson. Deterministic Space-Bounded Graph Connectivity Algorithms. Manuscript. 1998.
  2. ^ Harry R. Lewis and Christos H. Papadimitriou. Symmetric space-bounded computation. Theoretical Computer Science. pp.161-187. 1982.

References[edit]

  • Reingold, Undirected STConnectivity in LogSpace, STOC 2005.
  • Lecture Notes :CS369E: Expanders in Computer Science By Cynthia Dwork & Prahladh Harsha
  • Lecture Notes
  • Symmetric LogSpace is closed undercomplement Noam Nissa
  • Sharon Bruckner Lecture Notes
  • Deterministic Space Bounded Graph connectivity Algorithms Jesper Janson