Tag Archives: Computational Complexity

Research scientist Lance Fortnow infiltrates the New York Times with a computational complexity problem nobody but egg heads can comprehend.

Whether or not P equals NP.

Posted in Research, Science | Tagged , , , | Leave a comment

Prof Lance, please, adjust the sound.

Posted in Humor, People | Tagged , , , | Leave a comment

Computational Complexity + Statistical Modeling

http://blog.computationalcomplexity.org/ New URL —adjust your bookmark immediately. A much more interesting blog than Overcoming Whatever. I read it in tandem with Andrew Gelman’s blog (on modeling), which is equally awesome and instructive.

Posted in Resources - References | Tagged , , , , | Leave a comment