Timeline for Is $L = \{ \langle \langle \ M\ \rangle \rangle \ | \ M \ \text{does not accept}\ 010 \} $ Turing recognizeable?
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 20, 2019 at 7:22 | history | edited | dkaeae | CC BY-SA 4.0 |
Formatting, language tweaks
|
| May 19, 2019 at 18:19 | vote | accept | Da Mike | ||
| May 19, 2019 at 16:23 | comment | added | lox | It's not a proof, its mostly hand waving and (your) intuition. To show $L$ does not belong in a certain class, you must show a specific TM reduction to another TM language that is known not to be in that class. | |
| May 19, 2019 at 12:14 | answer | added | Yuval Filmus | timeline score: 1 | |
| May 19, 2019 at 11:50 | history | edited | Da Mike | CC BY-SA 4.0 |
edited title
|
| May 19, 2019 at 11:37 | history | asked | Da Mike | CC BY-SA 4.0 |