Timeline for Closure Properties between different Language Classes
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 10, 2017 at 7:33 | comment | added | Yuval Filmus | To show that $L_1 \cap L_2$ is not necessarily decidable, you need to give an example in which it isn't. | |
| Jun 9, 2017 at 20:50 | review | Close votes | |||
| Jun 25, 2017 at 3:01 | |||||
| Jun 9, 2017 at 20:32 | comment | added | David Richerby | We discourage "please check whether my answer is correct" questions, as only "yes/no" answers are possible, which won't help you or future visitors. See here and here. Can you edit your post to ask about a specific conceptual issue you're uncertain about? As a rule of thumb, a good conceptual question should be useful even to someone who isn't looking at the problem you happen to be working on. If you just need someone to check your work, you might seek out a friend, classmate, or teacher | |
| Jun 9, 2017 at 16:45 | answer | added | chi | timeline score: 1 | |
| Jun 9, 2017 at 16:41 | comment | added | fade2black | You are right. L1 intersection L2 is not necessarily decidable, but it is recognizable (recursively enumerable, partially computable). | |
| Jun 9, 2017 at 15:49 | review | First posts | |||
| Jun 9, 2017 at 20:32 | |||||
| Jun 9, 2017 at 15:47 | history | asked | LEJ | CC BY-SA 3.0 |