[ 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

Search:


View post   

>> No.15693979 [View]
File: 34 KB, 600x400, np.jpg [View same] [iqdb] [saucenao] [google]
15693979

N = NP /:n
P=1
Here i solved it.

>> No.15653538 [View]
File: 34 KB, 600x400, 20100816151036-0_0.jpg [View same] [iqdb] [saucenao] [google]
15653538

Isn't P vs NP irrelevant because it says nothing about quantum computing?

>> No.15471361 [View]
File: 34 KB, 600x400, 20100816151036-0_0.jpg [View same] [iqdb] [saucenao] [google]
15471361

Relative to the P versus NP problem, if it is true that FTL technology can exist (as interpreted relative to quantum mechanics falsifying the EPR paradox via spooky action at a distance), then is it not true that P=NP?

Picture from https://news.mit.edu/2009/explainer-pnp

>> No.15339305 [View]
File: 34 KB, 600x400, 20100816151036-0_0.jpg [View same] [iqdb] [saucenao] [google]
15339305

sorry for stupid question

>> No.15042640 [View]
File: 34 KB, 600x400, pnp.jpg [View same] [iqdb] [saucenao] [google]
15042640

P = NP
P/P = (NP)/P
N = 1

What's so hard about it?

>> No.15032054 [View]
File: 34 KB, 600x400, 20100816151036-0_0.jpg [View same] [iqdb] [saucenao] [google]
15032054

The complete proof of P=NP is as follows:

If P and NP are equal sets, then any problem in the P set can be solved in polynomial time using a verification algorithm in the NP set. This is demonstrated by the set theorem, which states that if two sets are equal, then their intersection is also equal.

To illustrate how this theorem is applied to our formula, consider the following sets:

P = {p1, p2, p3, ..., pn}
NP = {verification(p1), verification(p2), verification(p3), ..., verification(pn)}

Where "P" is the set of all problems that can be solved in polynomial time. The "verification" function is used to apply a verification algorithm to any problem in the P set to solve it in polynomial time.

If P and NP are equal sets, then their intersection is also equal. This means that any problem in the P set can be solved in polynomial time using a verification algorithm in the NP set. In other words, if P and NP are equal sets, then any problem that can be solved in polynomial time (NP), and vice versa.

To prove that this statement is true, consider an arbitrary problem "p" in the P set. If P and NP are equal sets, then "p" can be verified in polynomial time using a verification algorithm in the NP set.

On the other hand, if "p" can be verified in polynomial time using a verification algorithm in the NP set, then it belongs to NP and therefore P and NP are equal sets.

In summary, the complete proof of P=NP consists of applying the set theorem to show that if P and NP are equal sets, then any problem in P can be verified in polynomial time using a verification algorithm in NP, and vice versa. This demonstrates that P and NP are equal sets, implying that P=NP.


God bless us all.

>> No.12255520 [View]
File: 35 KB, 600x400, 20100816151036-0_0.jpg [View same] [iqdb] [saucenao] [google]
12255520

This thread is dedicated to solving the P=NP problem. The price money will be divided between every poster in this thread.

Navigation
View posts[+24][+48][+96]