The Stack Overflow podcast is back! Listen to an interview with our new CEO.
21
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

2
answers
3
questions
~234
people reached
  • USA
  • Member for 2 years, 4 months
  • 20 profile views
  • Last seen Feb 21 at 17:17

Top tags (7)

Score 1
Posts 4
Posts % 80
Score 1
Posts 2
Score 0
Posts 2
Score 0
Posts 1
Score 0
Posts 1
Score 0
Posts 1

Top posts (5) All Questions Answers | Votes Newest

Badges (5)

Gold

Silver

Bronze

5

Rarest