Timeline for How much of P versus NP's difficulty stems from having to rule out the existence of Turing machines that "accidentally" solve, say, 3-SAT efficiently?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:57 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Aug 9, 2011 at 3:09 | vote | accept | Chris Jerdonek | ||
| Aug 2, 2011 at 18:35 | answer | added | Emil Jeřábek | timeline score: 6 | |
| Aug 2, 2011 at 18:28 | comment | added | user5810 | Or just consistent with ZF, since all arithmetical theorems of ZFC are provable in ZF. | |
| Aug 2, 2011 at 18:19 | history | asked | Chris Jerdonek | CC BY-SA 3.0 |