Timeline for Finite languages are Turing decidable - contradiction [duplicate]
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 5, 2017 at 14:20 | vote | accept | SebiSebi | ||
| Feb 5, 2017 at 13:38 | history | closed |
David Richerby Yuval Filmus formal-languages Users with the formal-languages badge or a synonym can single-handedly close formal-languages questions as duplicates and reopen them as needed. |
Duplicate of How can it be decidable whether $\pi$ has some sequence of digits? | |
| Feb 5, 2017 at 13:37 | review | Close votes | |||
| Feb 5, 2017 at 13:38 | |||||
| Feb 5, 2017 at 13:22 | comment | added | David Richerby | Not a literal duplicate but it covers the same ground: we have a language $L$ that could be either $L_1$ or $L_2$; both are obviously decidable but we don't know which one really is $L$. | |
| Feb 5, 2017 at 13:08 | history | edited | David Richerby | CC BY-SA 3.0 |
LaTeX
|
| Feb 5, 2017 at 13:06 | answer | added | Yuval Filmus | timeline score: 3 | |
| Feb 5, 2017 at 12:42 | review | First posts | |||
| Feb 5, 2017 at 13:42 | |||||
| Feb 5, 2017 at 12:40 | history | asked | SebiSebi | CC BY-SA 3.0 |