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.
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.
P does not equal NP.
Member for 3 years, 8 months
28 profile views
Last seen Apr 6 at 18:32