In Theorem 3.21, Introduction to the theory of computation. We showed that a language is Turing-recognizable iff some enumerator enumerates it. Why didn’t we use the following simpler algorithm for the forward direction of the proof? As before, s1, s2, . . . is a list of all strings in Σ*.
E = "Ignore the input.
1. Repeat the following for i = 1, 2, 3, . . . .
2. RunM on si.
3. If it accepts, print out si."