Timeline for Turing Machines: What is the difference between recognizing, deciding, total, accepting, rejecting?
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S May 29, 2023 at 17:13 | history | suggested | MAChitgarha | CC BY-SA 4.0 |
Fix a small confusing typo
|
| Feb 28, 2023 at 16:05 | review | Suggested edits | |||
| S May 29, 2023 at 17:13 | |||||
| Jul 1, 2019 at 18:00 | comment | added | user106386 | @NicHartley Something along the lines of ;recognising only cares that it accepts all strings in that language, there is no specification for if the string is not in the language, ie it can halt and reject or it can loop forever. Deciding says it must reject strings not in the language | |
| Jul 1, 2019 at 17:56 | comment | added | anon | It might be worth emphasizing the difference between recognition and decision for people like me who didn't get it at first. Maybe change "and no others" to "and either halts and rejects or doesn't halt at all on others"? I don't know enough CS to word that well, though. | |
| Jul 1, 2019 at 13:50 | comment | added | user106386 | I have added the corrections from the two above comments. I have not gone further into divergence on a string as it is not applicable for the question asked, however it would be incorrect to not mention it | |
| Jul 1, 2019 at 13:49 | history | edited | user106386 | CC BY-SA 4.0 |
Added corrections from comments
|
| Jul 1, 2019 at 13:25 | comment | added | chi | "A Turing Machine will either accept or reject a string." ...unless it diverges on that string. | |
| Jul 1, 2019 at 11:48 | comment | added | templatetypedef | Minor nit: a recognizer for a language halts and accepts on all strings in that language and no others. | |
| Jun 30, 2019 at 20:37 | vote | accept | WeCanBeFriends | ||
| Jun 30, 2019 at 20:33 | history | answered | user106386 | CC BY-SA 4.0 |