Timeline for Turing Machines: What is the difference between recognizing, deciding, total, accepting, rejecting?
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 11, 2021 at 20:17 | comment | added | John L. | @user466720 Try not to add new question(s) to an existing question, especially when it was posted months ago, especially it was not posted by yourself, especially when there are multiple answers and especially when there is an accepted answer. | |
| Mar 11, 2021 at 10:39 | review | Suggested edits | |||
| Mar 18, 2021 at 11:33 | |||||
| Jul 1, 2019 at 10:45 | comment | added | Giacomo Alzetta | Many differents turing machines can decide the same language (in fact for every language that has a TM that decides it there is an infinite number of TM deciding it... just take that TM and modify it so that when it would stop and accept/reject instead it does 1 step to the right and then stops and accepts/rejects. Then modify it again to move 1 step farther before stopping. You can do this for every n) | |
| Jul 1, 2019 at 6:00 | history | tweeted | twitter.com/StackCompSci/status/1145572767200403456 | ||
| Jul 1, 2019 at 2:58 | history | became hot network question | |||
| Jun 30, 2019 at 20:37 | vote | accept | WeCanBeFriends | ||
| Jun 30, 2019 at 20:33 | answer | added | user106386 | timeline score: 20 | |
| Jun 30, 2019 at 19:32 | vote | accept | WeCanBeFriends | ||
| Jun 30, 2019 at 20:37 | |||||
| Jun 30, 2019 at 19:12 | comment | added | Yuval Filmus | There's no such thing as "the language the Turing machine is defined over". | |
| Jun 30, 2019 at 19:12 | answer | added | Yuval Filmus | timeline score: 4 | |
| Jun 30, 2019 at 18:55 | history | asked | WeCanBeFriends | CC BY-SA 4.0 |