Enumerator (computer science): Difference between revisions

Content deleted Content added

Revision as of 03:51, 19 June 2024 edit Jlwoodwa (talk \| contribs) Autopatrolled, Administrators 106,425 edits more specific stubcat ← Previous edit		Latest revision as of 14:21, 10 January 2025 edit undo Svízel přítula (talk \| contribs) 11 edits Undid revision 1262222644 by Clarkwalkers (talk) Tag: Undo
(2 intermediate revisions by 2 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, ~~else~~otherwise ~~reject~~we continue. Note that if the string is not in the language, the turing machine will never halt, thus rejecting the string. == References ==