Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
airza
on Aug 17, 2015
|
parent
|
context
|
favorite
| on:
An Argument for P=NP (2005) [pdf]
If anyone with expertise has been lured in by this nonsense paper, do any of you think (like me) that P=NP is undecidable in ZFC?
_ks3e
on Aug 17, 2015
[–]
Scott Aaronson wrote a survey about that topic here:
http://www.scottaaronson.com/papers/pnp.pdf
Consider applying for YC's Winter 2027 batch!
Applications
are open till November 2.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
