Symmetric Turing Machine - Symmetric Log Space Complexity

Symmetric Log Space Complexity

  • 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.

Read more about this topic:  Symmetric Turing Machine

Famous quotes containing the words log, space and/or complexity:

    There was now no road further, the river being the only highway, and but half a dozen log huts, confined to its banks, to be met with for thirty miles. On either hand, and beyond, was a wholly uninhabited wilderness, stretching to Canada.
    Henry David Thoreau (1817–1862)

    Finally she grew quiet, and after that, coherent thought. With this, stalked through her a cold, bloody rage. Hours of this, a period of introspection, a space of retrospection, then a mixture of both. Out of this an awful calm.
    Zora Neale Hurston (1891–1960)

    The price we pay for the complexity of life is too high. When you think of all the effort you have to put in—telephonic, technological and relational—to alter even the slightest bit of behaviour in this strange world we call social life, you are left pining for the straightforwardness of primitive peoples and their physical work.
    Jean Baudrillard (b. 1929)