Work email ban after hours in New York City may become law

[Okeefenokee]

There ought to be a law.

There's two of them, conservation of energy, and entropy. Got a bunch I gotta get done tomorrow.

My laws are more mathematical in nature. Some of them are mysterious. Does P=NP?

Only if N=1.

[SuburbanFarmer]

There's two of them, conservation of energy, and entropy. Got a bunch I gotta get done tomorrow.

My laws are more mathematical in nature. Some of them are mysterious. Does P=NP?

Only if N=1.

or 0.

[Speaker to Animals]

There's two of them, conservation of energy, and entropy. Got a bunch I gotta get done tomorrow.

My laws are more mathematical in nature. Some of them are mysterious. Does P=NP?

Only if N=1.

NP := nondeterministic polynomial time.

P := polynomial time

A problem that is polynomial is something like sorting a deck of cards.
A problem that is nondeterministic polynomial is something like the traveling salesmen problem.

Figuring out the answer to this question is as big as e=mc^2. (seriously). If you could prove that P=NP a lot of shit would change overnight.

https://en.wikipedia.org/wiki/P_versus_ ... f_solution

[Okeefenokee]

My laws are more mathematical in nature. Some of them are mysterious. Does P=NP?

Only if N=1.

or 0.

P=0*P only if P=0

[Speaker to Animals]

This is what happens if you can solve an NP problem in polynomial time.

[SuburbanFarmer]

My laws are more mathematical in nature. Some of them are mysterious. Does P=NP?

Only if N=1.

NP := nondeterministic polynomial time.

P := polynomial time

A problem that is polynomial is something like sorting a deck of cards.
A problem that is nondeterministic polynomial is something like the traveling salesmen problem.

Figuring out the answer to this question is as big as e=mc^2. (seriously). If you could prove that P=NP a lot of shit would change overnight.

https://en.wikipedia.org/wiki/P_versus_ ... f_solution

Seems pretty obvious that N <> NP. I don't see why anyone would think otherwise, tbh.

[Speaker to Animals]

Only if N=1.

NP := nondeterministic polynomial time.

P := polynomial time

A problem that is polynomial is something like sorting a deck of cards.
A problem that is nondeterministic polynomial is something like the traveling salesmen problem.

Figuring out the answer to this question is as big as e=mc^2. (seriously). If you could prove that P=NP a lot of shit would change overnight.

https://en.wikipedia.org/wiki/P_versus_ ... f_solution

Seems pretty obvious that N <> NP. I don't see why anyone would think otherwise, tbh.

Obvious how? Can you prove it?

[SuburbanFarmer]

NP := nondeterministic polynomial time.

P := polynomial time

A problem that is polynomial is something like sorting a deck of cards.
A problem that is nondeterministic polynomial is something like the traveling salesmen problem.

Figuring out the answer to this question is as big as e=mc^2. (seriously). If you could prove that P=NP a lot of shit would change overnight.

https://en.wikipedia.org/wiki/P_versus_ ... f_solution

Seems pretty obvious that N <> NP. I don't see why anyone would think otherwise, tbh.

Obvious how? Can you prove it?

Sure. Pretty much all of human experience points to N<>NP.

You can grade a test faster than you can answer the questions. Checking against the answer sheet takes less time than solving the problems (on a math test, for example).

If you're asking for a mathematical proof, no I couldn't. But the answer is obvious - and completed much faster than any computation of the problem.

[Speaker to Animals]

Seems pretty obvious that N <> NP. I don't see why anyone would think otherwise, tbh.

Obvious how? Can you prove it?

Sure. Pretty much all of human experience points to N<>NP.

You can grade a test faster than you can answer the questions. Checking against the answer sheet takes less time than solving the problems (on a math test, for example).

If you're asking for a mathematical proof, no I couldn't. But the answer is obvious - and completed much faster than any computation of the problem.

That's not what this means. And, no, there really is no "experience" that points towards either solution. Most computer scientists believe P != NP, but really have no way to prove it. It doesn't seem provable with any of the formal techniques we use today.

[SuburbanFarmer]

Obvious how? Can you prove it?

Sure. Pretty much all of human experience points to N<>NP.

You can grade a test faster than you can answer the questions. Checking against the answer sheet takes less time than solving the problems (on a math test, for example).

If you're asking for a mathematical proof, no I couldn't. But the answer is obvious - and completed much faster than any computation of the problem.

That's not what this means. And, no, there really is no "experience" that points towards either solution. Most computer scientists believe P != NP, but really have no way to prove it. It doesn't seem provable with any of the formal techniques we use today.

It's probably not provable. It's simply common sense, though.

There's no way that you could solve every problem as quickly as checking against the solution. That's ridiculous.

Did I misunderstand the article?