7
reputation
3

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
2
questions
~186
people reached
  • Member for 2 months
  • 12 profile views
  • Last seen Jul 4 at 22:40

Top tags (2)

Score 0
Posts 2
Score 0
Posts 1

Top posts (2) All Questions Answers | Votes Newest

Badges (3)

Gold

Silver

Bronze

3

Rarest