[ 3 / biz / cgl / ck / diy / fa / ic / jp / lit / sci / vr / vt ] [ index / top / reports ] [ become a patron ] [ status ]
2023-11: Warosu is now out of extended maintenance.

/sci/ - Science & Math


View post   

File: 168 KB, 727x682, apu.png [View same] [iqdb] [saucenao] [google]
16051734 No.16051734 [Reply] [Original]

so uh apparently these questions are so hard that each solution is worth one million dollars

>P vs NP
>The question is whether or not, for all problems for which an algorithm can verify a given solution quickly (that is, in polynomial time), an algorithm can also find that solution quickly.

kek this one is a no brainer, the answer is no obviously. where is my million dollars?

i dont even understand the other questions but if we really did our best we could solve them all i guess

>> No.16051737

P=NP
N=1
qed

>> No.16051740

The only guy who won one these declined the prize. Probably because he was embarrassed at how easy it was.