Conceptual error in the "enumerable language is turing recognizable" section. If the strings do not match when we enumerate, we CANNOT reject, since the string might be enumerated later on. The best we can do is continue enumerating (if the string isn't in the language it will never halt effectively rejecting). |
Undid revision 1262222644 by Clarkwalkers (talk) |
| (One intermediate revision by one other user not shown) | |
(No difference)
| |
