Timeline for How to make an undecidable Turing Machine decidable?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 14, 2015 at 1:42 | comment | added | D.W.♦ | Hello! We discourage posts that simply state a problem out of context, and expect the community to solve it. Assuming you tried to solve it yourself and got stuck, it may be helpful if you wrote your thoughts and what you could not figure out. | |
| Dec 13, 2015 at 10:36 | answer | added | Ariel | timeline score: 5 | |
| Dec 13, 2015 at 10:01 | comment | added | Raphael | It's early for me and I've not fully woken up yet, but this problem seems unsolvable. See also here. (cc @DavidRicherby) | |
| Dec 13, 2015 at 9:37 | history | edited | Raphael |
edited tags
|
|
| Dec 13, 2015 at 8:10 | comment | added | David Richerby | I don't understand your question. There's no such thing as an "undecidable Turing machine". Undecidability is a property of problems, meaning loosely that no Turing machine solves that problem. | |
| Dec 13, 2015 at 4:26 | review | First posts | |||
| Dec 13, 2015 at 8:10 | |||||
| Dec 13, 2015 at 4:24 | history | asked | Divine | CC BY-SA 3.0 |