The Stack Overflow podcast is back! Listen to an interview with our new CEO.
78
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
5
questions
~708
people reached
  • Member for 7 months
  • 31 profile views
  • Last seen Oct 16 at 0:03

Top tags (6)

Score 0
Posts 3
Posts % 60
Score 0
Posts 2
Score 0
Posts 2
Score 0
Posts 2
Score 0
Posts 1
Score 0
Posts 1

Top posts (5) All Questions Answers | Votes Newest

Badges (7)

Gold

Silver

Bronze

7

Rarest