where ) whose language is . Initially, receives no input, and all the tapes are blank (i.e., filled with blank symbols). Newly defined symbol is the delimiter that marks end of an element of . The second tape can be regarded as the printer, strings on it are separated by . The language enumerated by an enumerator denoted by is defined as set of the strings on the second tape (the printer).

Equivalence of Enumerator and Turing Machines

A language over a finite alphabet is Turing Recognizable if and only if it can be enumerated

1.Previous
3.Next