Timeline for Turing machine where the next step is determined by the state and the symbols up to the read/write head
Current License: CC BY-SA 4.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 8, 2019 at 13:40 | history | became hot network question | |||
| Jul 8, 2019 at 11:37 | vote | accept | CommunityBot | ||
| Jul 8, 2019 at 11:06 | comment | added | John L. | OK, although it would be great to credit that "small textbook". | |
| Jul 8, 2019 at 11:01 | comment | added | user99674 | Sorry for not responding erlier, it is actually taken from a small textbook my teacher handed which is not in english | |
| Jul 8, 2019 at 10:16 | comment | added | John L. | Could you please add a reference to the textbook in which this problem appears? Thanks. | |
| Jul 8, 2019 at 9:48 | answer | added | gandalf61 | timeline score: 1 | |
| Jul 8, 2019 at 6:20 | answer | added | John L. | timeline score: 1 | |
| Jul 8, 2019 at 1:18 | comment | added | user99674 | @Apass.Jack I'm not sure I understand what you meant with your second comment. This is a question from my text book and this is how it's defined. And by "this subject" I meant Turing machines different variations. Perhaps it was expressed badly so I took it off, sorry. | |
| Jul 8, 2019 at 1:12 | history | edited | user99674 | CC BY-SA 4.0 |
deleted 175 characters in body
|
| Jul 7, 2019 at 23:56 | comment | added | John L. | Just to note that the states can be removed from this kind of machine without diminishing their collective power since the machine can just treat some symbol as states, writing them on the tape. | |
| Jul 7, 2019 at 22:29 | history | edited | user99674 | CC BY-SA 4.0 |
added 134 characters in body
|
| Jul 7, 2019 at 22:23 | history | asked | user99674 | CC BY-SA 4.0 |