[ 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: 23 KB, 414x255, 414px-Complexity_classes.svg.png [View same] [iqdb] [saucenao] [google]
10165827 No.10165827 [Reply] [Original]

What happens to mankind if we solve this problem?

>> No.10165831

>>10165827
Nothing. An [math]\Omega(n^4)[/math] solution to SAT wouldn't change anything.

>> No.10165832

>>10165827
All problems can be solved in constant time if the constant is big enough!

>> No.10165836

>>10165832
you can't solve the halting problem

>> No.10165840

>>10165836
All programs halt because at some point on the way to the heat death of the universe their computational substrate will break down!

>> No.10165845

>>10165840
>all progams halt because the universe has to end
uh, nah. That's not halting in the formal sense

>> No.10165850

>>10165845
All formal systems are just silly games with symbols and are ultimately meaningless!

>> No.10165852

>>10165850
so is math and by extension physics. Next question.

>> No.10165862

>>10165852
All fields of knowledge not directly related to the creation of sentient anime qts are nothing but wasteful mental masturbation anyway!

>> No.10165865
File: 1.33 MB, 1884x2164, TRINITY___Conspiracy.png [View same] [iqdb] [saucenao] [google]
10165865

>>10165827
big problem

>> No.10165877

p = np. all algorithms run in polynomial time because you can just rewrite their time complexity as a taylor series.

>> No.10165878
File: 68 KB, 1280x720, TIMESAND___762+++sdiwfsdvwe6ye5tfytit9wq2118661999191991959s59s.jpg [View same] [iqdb] [saucenao] [google]
10165878

>>10165865
WOW

>> No.10165882

>>10165877
Sounds like something worth publishing on vixra

>> No.10165983

>>10165865
the fuck is this spergbarf of an image even trying to claim?

>> No.10165999

>>10165827
P doesn't equal NP, so once we prove that, nothing changes

>> No.10166001

>>10165827
If we prove P != NP (which is what is expected), nothing will happen because everyone pretty much assumes this already.

If we prove P = NP, things may change depending on whether the polynomial reduction is found. If it is then we can apply it to solve NP problems in P time, if not, then the next problem would be to find the reduction.

>>10165832
>>10165877
People like (you) are why we should have a scientific captcha on /sci/.

>> No.10166607
File: 33 KB, 540x406, 1534195838948.jpg [View same] [iqdb] [saucenao] [google]
10166607

Why are you guys arguing over semiconductors?