We’re rewarding the question askers & reputations are being recalculated! Read more.
129
reputation
5

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
3
questions
~550
people reached
  • Member for 1 year, 1 month
  • 94 profile views
  • Last seen Oct 4 at 18:21

Top tags (4)

Score 0
Posts 3
Posts % 100
Score 0
Posts 1
Score 0
Posts 1
Score 0
Posts 1

Top posts (3) All Questions Answers | Votes Newest

Badges (5)

Gold

Silver

Bronze

5

Rarest