Timeline for Mapping reducibility from recursive to recursively enumerable language
Current License: CC BY-SA 4.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 21, 2019 at 21:00 | history | tweeted | twitter.com/StackCompSci/status/1153047132779241474 | ||
| Jul 21, 2019 at 15:02 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jun 21, 2019 at 14:00 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| May 22, 2019 at 13:14 | history | edited | dkaeae | CC BY-SA 4.0 |
Use TeX, formatting, improve language
|
| May 22, 2019 at 13:08 | answer | added | dkaeae | timeline score: 2 | |
| Aug 28, 2016 at 16:56 | comment | added | user40647 | Thanks for response. If L2 is recursive, the statement is true and can be proved easily, however it's also possible from the problem statement that L2 is recursively enumerable, but not recursive so we need to show that case as well. | |
| Aug 27, 2016 at 10:40 | history | edited | Raphael |
edited tags
|
|
| Aug 27, 2016 at 10:29 | comment | added | David Richerby | Also, you can use LaTeX here to typeset mathematics in a more readable way. See here for a short introduction. | |
| Aug 27, 2016 at 10:28 | comment | added | David Richerby | Do you mean for $L_2$ to be recursively enumerable but not recursive? Remember that all recursive languages are also RE. | |
| Aug 26, 2016 at 22:20 | history | edited | user40647 | CC BY-SA 3.0 |
added better explanation
|
| Aug 26, 2016 at 22:13 | review | First posts | |||
| Aug 27, 2016 at 10:29 | |||||
| Aug 26, 2016 at 22:12 | history | asked | user40647 | CC BY-SA 3.0 |