Timeline for Decidability of language of TMs which accept only their Gödel number [duplicate]
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 2, 2019 at 9:49 | history | closed |
John L. Evil David Richerby Yuval Filmus turing-machines Users with the turing-machines badge or a synonym can single-handedly close turing-machines questions as duplicates and reopen them as needed. |
Duplicate of Machines whose languages are their own encoding | |
| Feb 1, 2019 at 18:45 | review | Close votes | |||
| Feb 2, 2019 at 9:49 | |||||
| Feb 1, 2019 at 18:33 | vote | accept | Marc | ||
| Feb 1, 2019 at 17:47 | history | edited | Yuval Filmus | CC BY-SA 4.0 |
added 18 characters in body; edited title
|
| Feb 1, 2019 at 17:46 | answer | added | Yuval Filmus | timeline score: 0 | |
| Feb 1, 2019 at 17:40 | comment | added | Marc | unfortunately not | |
| Feb 1, 2019 at 17:24 | comment | added | Yuval Filmus | Are you familiar with the recursion theorem? | |
| Feb 1, 2019 at 17:06 | history | asked | Marc | CC BY-SA 4.0 |