45
reputation
1
7

Travis Wells

This is what an INTP sees in others if he believes that P=NP

Trademan's Fallacy/The herd fallacy

:( Although proven, we wait for a P vs NP proof.

No algorithm is currently known to recovery solutions to NP hard problems in poly time.

x,Px->Rx

Even, if we are faced with incontrovertible proof that a language is used to generate NP-hard problems and an algorithim recovers its solutions in poly time.

x,Px->(Lx&Sx)

Therefore,

P does not equal NP.

x,(Lx&Sx)->Rx

0
answers
8
questions
~1k
people reached
  • Member for 4 months
  • 183 profile views
  • Last seen 3 hours ago

Top tags (9)

Score 0
Posts 5
Posts % 62
Score 0
Posts 3
Score 0
Posts 3
Score 0
Posts 2
Score 0
Posts 1
Score 0
Posts 1

Top posts (8) All Questions Answers | Votes Newest

Badges (8)

Gold

Silver

1

Rarest

Bronze

7

Rarest