The Gateway to Computer Science Excellence

0 votes

In Theorem $3.21$, 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, $s_{1}, s_{2},\dots $ is a list of all strings in $\Sigma^{\ast}.$

$E = "$ Ignore the input.

- Repeat the following for $i = 1,2,3,\dots.$
- Run $M$ on $s_{i}.$
- If it accepts, print out $s_{i}."$

52,345 questions

60,482 answers

201,809 comments

95,283 users