Timeline for Proving that a class of languages is a subset of RE for Rice Theorem
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 2, 2018 at 18:39 | vote | accept | Eloo | ||
| Dec 31, 2017 at 20:03 | vote | accept | Eloo | ||
| Dec 31, 2017 at 20:55 | |||||
| Dec 31, 2017 at 19:58 | history | edited | Eloo | CC BY-SA 3.0 |
added 6 characters in body
|
| Dec 31, 2017 at 18:39 | answer | added | Raphael | timeline score: 2 | |
| Dec 31, 2017 at 18:36 | history | edited | Raphael | CC BY-SA 3.0 |
edited tags
|
| Dec 31, 2017 at 17:31 | comment | added | chi | Also note that the sub-languages $L$ of $0(0\cup 1)^*$ are uncountably many, so surely some of them are not RE. I think you are not applying Rice correctly -- you probably should consider the recognizable sub-languages, only. | |
| Dec 31, 2017 at 17:29 | comment | added | chi | $L\in \Sigma^*$ means that $L$ is a word, not a language. You probably mean $L\subseteq \Sigma^*$. | |
| Dec 31, 2017 at 14:03 | history | asked | Eloo | CC BY-SA 3.0 |