Timeline for Is the language containing Turing machine $(M_1, M_2)$ such that $L(M_1) \cup L(M_2) = \Sigma^*$ decidable?
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 23, 2021 at 20:43 | comment | added | Steven | I have edited your question. Please check if it matches what you intended to ask. Also it is still unclear what $E_{TM}$ is and how reducing to (and not from) another language would help to prove that your language is undecidable. | |
| Nov 23, 2021 at 20:42 | history | edited | Steven | CC BY-SA 4.0 |
added 44 characters in body; edited title
|
| S Nov 23, 2021 at 20:40 | review | Close votes | |||
| Nov 24, 2021 at 9:04 | |||||
| Nov 23, 2021 at 20:20 | answer | added | Steven | timeline score: 4 | |
| Nov 23, 2021 at 19:34 | comment | added | Andrej Bauer | What are $M_1$ and $M_2$? The question is unclear, please define precisely "the resulting language". And if this is an exercise, please transliterate the exact wording. | |
| S Nov 23, 2021 at 19:22 | review | First questions | |||
| S Nov 23, 2021 at 20:40 | |||||
| S Nov 23, 2021 at 19:22 | history | asked | S.Moore | CC BY-SA 4.0 |