Timeline for Given the Turing machines M1 and M2, is L (M1) = L (M2)? is decidable?
Current License: CC BY-SA 4.0
12 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jan 10, 2021 at 10:03 | comment | added | Bader Abu Radi | @Paradojin Here is a demonstration of how it can be done with Rice's theorem, if you're interested: cs.stackexchange.com/questions/19876/… | |
S Jan 10, 2021 at 6:53 | history | suggested | Bader Abu Radi | CC BY-SA 4.0 |
Rewritten it more clearly, and edited the tags.
|
Jan 9, 2021 at 21:47 | comment | added | Paradojin | @HankIgoe I did it differently as according to you you would by Rice's theorem? | |
Jan 9, 2021 at 17:53 | history | became hot network question | |||
Jan 9, 2021 at 17:18 | vote | accept | Paradojin | ||
Jan 9, 2021 at 11:05 | review | Suggested edits | |||
S Jan 10, 2021 at 6:53 | |||||
Jan 9, 2021 at 10:57 | answer | added | Bader Abu Radi | timeline score: 2 | |
Jan 9, 2021 at 10:45 | comment | added | Yuval Filmus | I suggest you keep trying. | |
Jan 9, 2021 at 10:37 | comment | added | Hank Igoe | It has been a few years since my theory course but if I recall right, that is undecidable. Look into Rice's theorem, it may be useful for this. | |
Jan 9, 2021 at 10:08 | review | Low quality posts | |||
Jan 9, 2021 at 11:57 | |||||
Jan 9, 2021 at 9:52 | review | First posts | |||
Jan 13, 2021 at 11:58 | |||||
Jan 9, 2021 at 9:50 | history | asked | Paradojin | CC BY-SA 4.0 |