Arjun Suresh (talk | contribs) (Created page with "If L and L' are both recursively enumerable, then L is recursive. Why? ===Solution=== Given L is RE. So there is a TM, which accepts and halts for all words in L. Now, if ...") |
Arjun Suresh (talk | contribs) |
||
| Line 5: | Line 5: | ||
Given L is RE. So there is a TM, which accepts and halts for all words in L. | Given L is RE. So there is a TM, which accepts and halts for all words in L. | ||
| − | Now, if L' is RE | + | Now, if L' is RE, then there is a TM, which accepts and halts for all words not in L. |
| − | So, if a word | + | So, if a word, from L or not from L,is given, give it to both those TMs. If its from L, the first TM will halt and we say it belongs to L. If its not from L, the second one will halt and we say it doesn't belong to L. Thus L becomes recursive. |
| − | |||
| − | |||
If L and L' are both recursively enumerable, then L is recursive. Why?
Given L is RE. So there is a TM, which accepts and halts for all words in L. Now, if L' is RE, then there is a TM, which accepts and halts for all words not in L. So, if a word, from L or not from L,is given, give it to both those TMs. If its from L, the first TM will halt and we say it belongs to L. If its not from L, the second one will halt and we say it doesn't belong to L. Thus L becomes recursive.
If L and L' are both recursively enumerable, then L is recursive. Why?
Given L is RE. So there is a TM, which accepts and halts for all words in L. Now, if L' is RE=> there is a TM, which accepts and halts for all words not in L. So, if a word is given from L or not from L, give it to both those TMs. If its from L, the first TM will halt and we say it belongs to L. If its not from L, the second one will halt and we say it doesn't belong to L. Thus L becomes recursive..
GATECSE