Idea About Why USTCON Is SL-complete
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.
Read more about this topic: Symmetric Turing Machine
Famous quotes containing the word idea:
“See, in the Navy, during the war, I got used to the idea that something might happen to me, I might not make it. Well, I also got used to the idea that my wife and children were safe at home, they’d be all right no matter what. But what I didn’t reckon with was that in this, this kind of a monstrous war, something might happen to them, and not to me. Well it did, and I can’t, I can’t cope with it.”
—John Paxton (1911–1985)