[Solved]4 10 Points Total Let Mi M2 Ms Enumeration Turing Machines Input Alphabet 0 1 Let W W2 Ws Q37209636

4. (10 points total) Let (Mi), (M2), (Ms).. be an enumeration of all Turing machines with input alphabet 0, 1. Let w, w2, ws,…be an enumeration of all binary strings. Prove that D w|i> 0 and Mi does not accept wi) is not Turing-recognizable. Hint: Use contradiction-assume D is Turing-recognizable and then use diagonalization Show transcribed image text 4. (10 points total) Let (Mi), (M2), (Ms).. be an enumeration of all Turing machines with input alphabet 0, 1. Let w, w2, ws,…be an enumeration of all binary strings. Prove that D w|i> 0 and Mi does not accept wi) is not Turing-recognizable. Hint: Use contradiction-assume D is Turing-recognizable and then use diagonalization

Expert Answer

---

Answer to 4. (10 points total) Let (Mi), (M2), (Ms).. be an enumeration of all Turing machines with input alphabet 0, 1. Let w, w2… . . .