Content deleted Content added
Citation bot (talk | contribs) Add: publisher. | Use this bot. Report bugs. | Suggested by Abductive | Category:Computing stubs | #UCB_Category 354/641 |
→Equivalence of Enumerator and Turing Machines: Fixed punctuation of "its" to "it's" |
||
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
== References ==
{{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}}
| |||