P=NP
>>62945505N=1
>>62945507not exactly unfortunately in the decimal system there is no real answer
>>62945505AI has proven it as such.
>>62945505It is almost certainly the case that P!=NP
>>62945505P=0N=0There you go froggy.
>>62945520Ai stonks price=0
Nope.
priced in
Logically everyone knows P != NP it's just that those millennium prize faggots need riGOrOUs MaTHeMaTICaL pROof as such for the obviousAs if 1 million dollars is a lot of money
>>62945505It's Pump = And * Dump, actually
>>62945505No. Ai will fall, but not to 0. It's a glorified library assistant. Its already too expensive for normies, and retards don't use it which is their target audience.P=1NP=1
>>62945507It could also be P=0
>>62945518>>62945627>>62946117it could also be that P = ∞, which means the value of N is irrelevant. it also would mean that P = NP functionally doesn't matter since we cannot achieve infinite P
>>62945627People don't understand complexity well enough to make claims about P/NP one way or the otherP=NP is a bad vibes outcome and people try to justify it after the fact
>>62945505nigger nigger nigger
>>62945507N=4
>>62946267Help me understand. I get N-ness. What's the other thing?
>>62945627exponential time hypothesis has already allegedly fallen (proved to be false). how can we be sure P != NP will remain true?
Average /biz/ comprehension
>>62947760Non-deterministic Polynomial. A polynomial time function is just a function whose cost can be described as a polynomial in terms of the inputs. Almost anything you write code for is polynomial time. The simplest example is linear time: F(n) = n. The cost of the function goes up linearly with the sizeof the input. More expensive is something like F(n) = n^2. Or, the cost goes up as the square of the input. In practical computing, anything that is n^2 is almost a non-starter. But polynomial time is anything expressible as a polynomial. It could be F(n) = n^1000, which is ridiculously huge.That's just P. "polynomial". NP problems are even harder. Non-deterministic polynomial. The travelling-salesman problem is NP complete. It gets so hard so fast, that it beats even the most ridiculous upper bound on any P function.
>>62945505AI JUST SOLVED THE HALTING PROBLEM!! LUDDITES BTFO
>>62945505Profit = No Profit ?
>>62946018>Its already too expensive for normiesTheir fake business model is too expensive for normies, isn't china showing that you can run AI locally on any GPU?
So if P=NP that means crypto is dead?Right?