This is related to the book "Introduction to Automata Theory, Languages, and Computation", 2nd edition. In chapter 9 exercise 9.1.3 a) Q: The set of all wi such that wi is not accepted by M2i.
In the online solution(http://infolab.stanford.edu/~ullman/ialcsols/ sol9.html#sol91) to the problem author has taken that any TM, which accepts the language: set of all wi such that wi is not accepted by M2i, be M = M2i. Howerver this assumption may be faulty (as far as my thinking says). If Mj be representation of any TM which accepts the language then j may or mayn't be 2i . It is possible that j is some odd natural number. Then, there exists no i such that j = 2i. So, we need to extend the solution. What are your views. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
