P = NP

Rather than P=NP, i am more amused by the blatant violation of Fermat theorem in the back

Could someone spoon feed a litfag about why this is such a big deal?

>>7799288
NP problems are renowned for being exponentially difficult to solve with greater variables. if someone were to bring them into P time, they would be solvable with far less computational power, and not with exponential increase in difficulty.

the conjecture of P=NP is that if you can bring an NP problem into P space, you can bring ALL NP problems into P space. this would mean that it's possible to break cryptography's entropy barrier with far less computational resources than anticipated.

>>7799290
What is P space?

File: screen-shot-2014-05-08-at-6.16.50-pm_wide-68c9dd352a5514d2ede51c42ad009b3ec41b4edd-s800-c85[1].png (171KB, 639x359px) Image search: [Google]

171KB, 639x359px

>>7799281
The difference between the two sides is smaller than an ordinary calculator can decide. Here's another "counter-example".

>>7799294
>>7799281
Mod a^n, b^n, and c^n by 2. You'll find these solutions are always 0+1=0 or 0+0=1.

>>7799288
It would essentially solve every single problem.

>>7799399
>This is what retarded CS majors believe

>>7799293
A space you define as the space containing all the possible P - problems vica versa for NP

>>7799437
>P space is the space containing all the problems contained in P space

>>7799290
>NP problems are renowned for being exponentially difficult
Exponentially, like O(2^n)? Isn't that a whole different class of problems, like solving chess?

>>7799288
https://www.youtube.com/watch?v=YX40hbAHx3s

>>7799674
Yes

>>7799676
NP problem means Nondeterminist polynomial, it's every probleme that you could solve in polynomial time if you were lucky.
In this kinf od problem it's usually easy to check if a solution work, but there are tons of possible solutions.

>>7799687
Yes, but doesn't that differ from exponential time? That's what I wanted to say. I'm not sure though, CS is not my field.

>>7799674
Seems not so intuitive as a non mathematician.

>>7799704
Read a little about deterministic Turing Machines and nondeterministic Turing Machines. It'll make more sense when you look at it in the context of those.

>>7798497
>>7799294
there are really cool books on math in the simpsons if anyone cares

>>7799857
Simpson's rule?

>>7799874
I can't tell if thats a book I can't find or if thats a joke about the theorem
god help me

>>7799704

You're right and they're wrong.

P ⊆ NP∩coNP ⊆ NP∪coNP ⊆ PSPACE ⊆ EXPTIME ⊆ NEXPTIME ⊆ EXPSPACE
with P ⊊ EXPTIME, NP ⊊ NEXPTIME, PSPACE ⊊ EXPSPACE

It's just that the best algorithms we have so far are exponential

>CS is not my field

Don't worry, 99.95% of CS graduate don't understand their own field and 99.5% can't even code.

>>7799900
https://en.wikipedia.org/wiki/Simpson's_rule
http://www.amazon.com/Simpsons-Their-Mathematical-Secrets/dp/1620402785/

>>7800163
>Don't worry, 99.95% of CS graduate don't understand their own field and 99.5% can't even code.

Sad but true

>>7798497
>Read a Chemical Engineering paper about a phase equilibria optimisation.
>Suddenly the author starts talking about the implications of the results on the P = NP problem in the conclusion.

When will this meme die?

File: rainbow.jpg (43KB, 605x628px) Image search: [Google]

43KB, 605x628px

>>7798497
$ python
>>> 3987**12 + 4365**12
63976656349698612616236230953154487896987106L
>> 4472**12
63976656348486725806862358322168575784124416L

they differ after the 10th digit