I've read quite a few discussions about computational complexity and P=NP theorems, including several following a claim of a proof that, as expected P!=NP.
So I have a basis for comparison when I say that Julie Rehmeyer has written the best ever short discussion of computational complexity. It's ostensibly about "crowdsourcing peer review", but you ignore all of that. It's really about explaining the basic problem with bold excursions into the deepest realms of modern mathematics.
So where did Ms. Rehmeyer come from? Her LinkedIn site tells us she's a Wellesley/MIT alumn, which would explain some of it. Surprisingly, she doesn't seem to have a personal blog. That is different. Most freelancers keep a blog even if they only point to recent publications.
Post a Comment