Well, the title of this post pretty much tells the story; Geoffrey K. Pullum has published a proof that the Halting Problem is undecidable, in verse.  Here's an excerpt: Here’s the trick that I’ll use – and it’s simple to do. I’ll define a procedure, which I will call Q, that will use P’s predictions of halting success to stir up a terrible logical mess. Do read the whole thing, as it actually does contain a peer-reviewed proof. Personally, I find rhyme and meter to be underused tools in...