Gödel's Lost Letter and P=NP
Gödel’s Lost Letter and P=NP is a blog by by Dick Lipton and Ken Regan, and it is an absolute gold mine for anyone interested in the theory of computing and complexity.
In case you’re not following it already, I’d recommend you start with Stating P=NP Without Turing Machines, if only for the story about the student who “solved an open problem that he thought was just a hard homework problem”.
Some posts are fairly technical (and require quite a bit of math), while others are somewhat less so, and every once in a while they even cover subjects like the math of poker. Whenever someone claims a proof about P=NP, this is the place to go for insights!