Skip to main content

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

1
  • 3
    $\begingroup$ Usually, a Turing machine accepts (or rejects) a string in some language, whereas it decides some language. In other words, the language a Turing machine $M$ decides is exactly the set of strings it accepts. $\endgroup$ Commented Jan 28, 2013 at 9:06