Don't Fall In Love With Your Model: The Cautionary Tale of my Recent proof that P=NP

The article is (obviously) a joke. But it raises an interesting point about computation (namely, it's a small miracle that practically computable problems are usually those with polynomial time solutions.)

crackpottery