Timeline for Please explain "decidability" and "verifiability"
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 18, 2013 at 6:26 | vote | accept | Masroor | ||
| May 17, 2013 at 6:42 | comment | added | Raphael | These notions are not restricted to P and NP. Go back to the chapter about computability and enumerability. And look at the formal definitions. | |
| May 17, 2013 at 6:41 | history | edited | Raphael |
edited tags
|
|
| May 16, 2013 at 17:04 | answer | added | Joey Eremondi | timeline score: 7 | |
| May 16, 2013 at 16:58 | history | tweeted | twitter.com/#!/StackCompSci/status/335076697189781504 | ||
| May 16, 2013 at 15:26 | comment | added | Masroor | This article (cs.uky.edu/~lewis/cs-heuristic/text/class/p-np.html) puts some nice examples on the issue. | |
| May 16, 2013 at 15:02 | vote | accept | Masroor | ||
| May 16, 2013 at 23:26 | |||||
| May 16, 2013 at 15:02 | answer | added | Fayez Abdlrazaq Deab | timeline score: 1 | |
| May 16, 2013 at 13:44 | history | asked | Masroor | CC BY-SA 3.0 |