Question: We showed that a language is Turing recognizable iff some enumerator enumerates it. Why didn't we use the following simpler algorithm? Here si, S2, St..is

We showed that a language is Turing recognizable iff some enumerator enumerates it. Why didn't we use the following simpler algorithm? Here si, S2, St..is a listing of strings in *. E = "Ignore the input. 1. Repeat the following for i -1,2, 3,.. 2. Run M on si 3. If it accepts the print out s Please solve it clear. Thank vou
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
