News for hackers. Stuff that matters.
Re:Donald Knuth on P=NP at CMU-SV (2014) [video] by throwra620 on Wednesday March 09, 2022 @09:44AM (#30614911)
P = NP only if N is invariant over P and non zero. I don’t get why there’s so much commotion on it
Re:Donald Knuth on P=NP at CMU-SV (2014) [video] by nomel on Wednesday March 09, 2022 @01:05PM (#30617909)
There's $1,000,000 waiting for you [1], if you can prove that.

1. https://en.wikipedia.org/wiki/Millennium_Prize_Problems#P_ve...

Re:Donald Knuth on P=NP at CMU-SV (2014) [video] by paskozdilar on Thursday March 10, 2022 @08:42AM (#30626763)
I think the original poster was trying to make a more sophisticated version of the classic "P=NP iff P=0 or N=1" joke.
Re:Donald Knuth on P=NP at CMU-SV (2014) [video] by xiphias2 on Thursday March 10, 2022 @08:55AM (#30626903)
It doesn't sound sophisticated as it doesn't take P=N=0 into account for example. Yours is much better :)
Re:Donald Knuth on P=NP at CMU-SV (2014) [video] by throwthere on Thursday March 10, 2022 @09:34AM (#30627319)
I think this thread has room for 512 characters of jokes. So far we can fit both of those meeting that constraint so no need to choose favorites.
Re:Donald Knuth on P=NP at CMU-SV (2014) [video] by mcswell on Thursday March 10, 2022 @07:27PM (#30634567)
My proof is too big for the margins of this window. Guess it's time to get a larger monitor...
Re:Donald Knuth on P=NP at CMU-SV (2014) [video] by evanb on Friday March 11, 2022 @02:15AM (#30637216)
True. But also P!=NP if N = (P-1)!