Anonymous ID: c973b1 Nov. 30, 2017, 1:07 a.m. No.13868   🗄️.is 🔗kun   >>3874

THE SIDLEY AUSTIN DOC IS FROM 2009 AND OPENS BY SAYING "It possesses

nuclear weapons and missiles to deliver them"

 

https://www.cfr.org/sites/default/files/book_pdf/North_Korea_CSR42%20%281%29.pdf

Anonymous ID: c973b1 Nov. 30, 2017, 2:07 a.m. No.13977   🗄️.is 🔗kun   >>3983

>>13974

I don't know why you'd say that, P and NP refer to the classes of problems solvable in Polynomial and Non-Polynomial TIME respectively. Big-O analysis assumes that you can't perform multiple actions at the same time.

Anonymous ID: c973b1 Nov. 30, 2017, 2:17 a.m. No.13993   🗄️.is 🔗kun   >>3996

>>13983

Lol buddy you picked an argument with the wrong person

 

It's the same idea as (GP)GPU algorithms. Just because you can e.g. render NxM pixels simultaneously, provided enough compute units, does not mean that your algorithm is O(1) instead of O(NM). I'm not asserting that P!=NP, but I strongly suspect this to be the case based on experience with algorithm design.

Anonymous ID: c973b1 Nov. 30, 2017, 2:18 a.m. No.13995   🗄️.is 🔗kun

>>13990

Agree with everything you said, though I was trying to articulate that certain individuals simply lack the capacity to understand those way above them.