Timeline for Can a recursive language be uncountable?
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 30, 2015 at 10:42 | history | edited | babou |
edited tags
|
|
| Apr 29, 2015 at 18:16 | vote | accept | revisingcomplexity | ||
| Apr 29, 2015 at 18:00 | history | edited | Raphael |
edited tags
|
|
| Apr 29, 2015 at 17:38 | comment | added | André Souza Lemos | Yes. To be uncountable is, literally, a big deal. | |
| Apr 29, 2015 at 17:30 | answer | added | Yuval Filmus | timeline score: 5 | |
| Apr 29, 2015 at 17:27 | comment | added | revisingcomplexity | so you are saying there is no uncountable language that is recursive? | |
| Apr 29, 2015 at 17:12 | comment | added | Shaull | Over finite words and a finite alphabet $\Sigma$, every language is countable, since $\Sigma^*$ is countable... | |
| Apr 29, 2015 at 17:00 | history | asked | revisingcomplexity | CC BY-SA 3.0 |