Enumerator (computer science): Difference between revisions

Revision as of 16:19, 19 October 2022

Latest revision as of 14:21, 10 January 2025

(6 intermediate revisions by 5 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 itsit's a match, then we accept the input, elseotherwise rejectwe continue. Note that if the string is not in the language, the turing machine will never halt, thus rejecting the string.

== 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: Computability theory]]

[[Category: Theory of computation]]

{{compucomp-sci-theory-stub}}