Episode #125 of the Stack Overflow podcast is here. We talk Tilde Club and mechanical keyboards. Listen now
11
reputation
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
6
questions
~431
people reached
  • Member for 3 years, 10 months
  • 26 profile views
  • Last seen Oct 4 at 18:19

Top tags (9)

Score 0
Posts 4
Posts % 67
Score 0
Posts 2
Score 0
Posts 1
Score 0
Posts 1
Score 0
Posts 1
Score 0
Posts 1

Top posts (6) All Questions Answers | Votes Newest

Badges (7)

Gold

Silver

Bronze

7

Rarest