1
reputation
1

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
1
question
~78
people reached
  • Member for 3 months
  • 7 profile views
  • Last seen Oct 4 at 1:51

Top tags (1)

Score 0
Posts 1
Posts % 100

Top posts (1) All Questions Answers | Votes Newest

Badges (1)

Gold

Silver

Bronze

1

Rarest