Content deleted Content added
→Equivalence of Enumerator and Turing Machines: Fixed punctuation of "its" to "it's" |
Undid revision 1262222644 by Clarkwalkers (talk) |
||
| (4 intermediate revisions by 3 users not shown) | |||
Line 25:
'''An Enumerable Language is Turing Recognizable'''
It's very easy to construct a Turing Machine <math>M</math> that recognizes the enumerable language <math>L</math>. We can have two tapes. On one tape we take the input string and on the other tape, we run the enumerator to enumerate the strings in the language one after another. Once a string is printed in the second tape we compare it with the input in the first tape. If it's a match, then we accept the input,
== References ==
{{refbegin}}
* {{cite book |last=Sipser |first=Michael |title=Introduction to the Theory of Computation - International Edition |year=2012 |publisher=Cengage Learning |isbn=978-1-133-18781-3}}
{{refend}}
[[Category:
[[Category:
{{
| |||