Whats the big fuzz about?

Whats the big fuzz about?

Its all about simple algebra. If our algebra cant solve this easily, then clearly there's an inherent mistake on the foundational logic onto which we've decide to build our scientific framework.

>Its all about simple algebra
It's not clear why you can divide by P, why P is not a zero divisor in the ring of complexity classes?

>t. person who doesnt understand the problem or has never studied CS

Fuck off.

>Fuck off.
Do you need to swear?

>DUDE CS LMAO!

But there are better science fiction works out there, why should I dedicate CS any more time?

Have you ever considered the case where [math]P=0[/math]?

>muh CS

Hello brainlet

Imagine unironically thinking cs is not worth studying, user's IQ is in the double digits confirmed.

Yes. 0 = 0.

Now please take your science fiction on your way out. Thanks.

>worth studying
>worth

Define worth, brainlet.

Ingenious. Nice OP.

>>Actually thinks it's a literal equation.

Kill yourself OP.

What about when P = 0 and N = infinity? This problem is intractable

One can't.

...

When P = 0 you have If N is infinity and P is 0 then 0 = 0

If N is infinite and P is nonzero, then P = infinity

Its simple math, user.

I get OP though, why do CS tards have to write it like an equation if it is not one. If this was math or physics it would be called something like the P and NP problem.

This so much. CS lets btfo.

>equality only makes sense between numbers

but it's not even an equality so it makes even less sense, it's questioning whether or not it's an equality

STOP REPOSTING YOU STUPID NIG NOG
REEEEEEEEEEEEEEEEEEEEEEEEEEEE

If NP = P
0 = NP/P
N = 0
P = 1

0 = 0. Sorry.

Now proove that 0 is not a number.

>I get OP though, why do CS tards have to write it like an equation if it is not one.
It IS an equation.

>If this was math or physics it would be called something like the P and NP problem.
It's called the P versus NP problem in computer science. Close enough? When trying to be formal about it, sometimes an equality sign with question mark subscript is used.

nigga what

The problem literally asks whether P = NP is true.

May I say that
P = NP
NP - P = 0
P(N-1)=0
P=0 or N=1

You can't devide by P, because p could by 0
If you say:
P = NP
1 = NP/P if P =/= 0
It would be possible.

this joke has never nor will ever be funny

fukken saged

This. Thanks for clarifying OP's mistake.

C"""""S""""" brainlets just want to over complicate simple stuff.

>P(N-1)=0
>P=0 or N=1
Why is this the only solution?

P and NP are really just sets of specific problems. P are problems that can be solved with polynomial time complexity no matter the runtime environment, or even computer models. Doesn't matter if the algorithm is run on a Turing machine, kahn network, quantum biological computer, celluar based, p@Q@, multidimensional random access machine, lambda calculus machine, Markov machine, or wang machine model of computation... Basically this is the most efficient time complexity for computation on any real or theorized machine model. Likely runs the same on an alien computer from the nearest star system.

NP is another set of problems that we can verfiy quickly, but they take forever to calculate. Bitcoin block chain for example takes enourmous computational resources just to solve then problems of finding a new block.. Something like 300 quintillion cycles, but you can verify the block with just a handful (on any computational model or machine) to include a pocket calculator or even pen and paper.

Most people don't understand the concept of computational machines in the first place much less their provability. Computers aren't just CPUs. Computer Science deals with way more and it's all provable. These types of problems let us know how powerful computers can physically become.

Computer Science is also the major amplifier of scientific progress in every field.

>>>/reddit/

>C"""""S"""""
Computation Shenenigans
Happy now?

"What's the big fuss about differential calculus? Clearly dy/dx must equal y/x by simple algebra!"

(if you really want to know what NP actually means, is an adequate explanation)

>t. Brainlet

OPs post is perfectly logical.

>let's assume 1 = 2
>we can clearly see that 1 = 2
>therefore 1 = 2

Not the same thing, brainlet.

You didn't even do your shitty joke correctly you faggot, see

>You didn't even do your shitty joke correctly you faggot
Why the homophobia?

Why the intolerance?

Only if you're braindead.

OP is a dumb cunt, and you're a dumb cunt. Your willfull ignorance of CS terminology is not the fault of CS.

I don't understand if this is a running joke or if there are actually this many brainlets who don't understand the P = NP question.
This is the most important millennial problem as well. It's more important than finding the gay ass theory of everything.

>tfw we have this thread every day and people still respond to it

Fucking spam.

Yeah man no swearing on our Christian board