Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
TekMol
on Aug 14, 2017
|
parent
|
context
|
favorite
| on:
A Solution of the P versus NP Problem?
Say you wanted to let a computer search for a proof of P!=NP - which axioms would you start with and which rules to transform the axioms into additional valid statements?
brianberns
on Aug 14, 2017
|
next
[–]
I wonder if the algorithm to search such a space of axioms and transforms for a solution would itself be P or NP. :)
yorwba
on Aug 15, 2017
|
parent
|
next
[–]
Almost certainly so super-exponential that NP appears easy in comparison.
javra
on Aug 15, 2017
|
prev
[–]
As far was most mathematicians and computer scientists would go, ZF and predicate logic together with a fixed definition of turing machines.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
