Timeline for Does Provable P equal Provable NP?
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 6, 2018 at 17:36 | comment | added | Caleb Stanford | Thanks for the answer and I'm sorry I didn't make that sentence more clear, is it clear now? | |
| Jul 6, 2018 at 17:34 | comment | added | Caleb Stanford | I thought that "strong enough to encode statements about Turing machines" has a fairly standard meaning. I mean the same requirements for Godel's 2nd incompleteness theorem. I'm not sure if it has to be as strong as PA, I seem to remember that slightly weaker is enough. | |
| Jul 5, 2018 at 11:21 | history | edited | xskxzr | CC BY-SA 4.0 |
added 180 characters in body
|
| Jul 5, 2018 at 10:14 | history | edited | Dmitri Urbanowicz | CC BY-SA 4.0 |
added 65 characters in body
|
| Jul 5, 2018 at 9:59 | history | answered | Dmitri Urbanowicz | CC BY-SA 4.0 |