Enumerator (computer science): Difference between revisions

Revision as of 11:42, 18 October 2022

Revision as of 16:19, 19 October 2022

Line 6:

==Formal definition==

{{Unreferenced section|date=April 2021}}

An enumerator <math>E</math> can be defined as a 2-tape Turing machine ([[Multitape Turing machine]] where <math> k=2 </math>) whose language is <math>\empty</math>. Initially, <math>E</math> receives no input, and all the tapes are blank (i.e., filled with blank symbols). Newly defined symbol <math>\#\in \Gamma\land\#\notin \Sigma</math> is the delimiter that marks end of an element of <math>S</math>. The second tape can be regarded as the printer, strings on it are separated by <math>\#</math>. The language ofenumerated by an enumerator <math>E</math> denoted by <math>L(E)</math> is defined as set of the strings on the second tape (the printer).

==Equivalence of Enumerator and Turing Machines==