The AcademiblogComputers::More signs I'm a geek
Posted: Sat Apr 15, 08:49 PM
Random browsing treasures!
Slashdot had a discussion about the Millennium Prizes and how someone wants to try set up a Wiki for solving them. Nevermind that I find the whole idea a peculiar one, it prompted me to look descriptions of P=NP and the like again since I had an idea of what they were, the exact idea always escaped me.
In doing so, I came upon a wikipedia post about P=NP, which had a quote by Hubert Chen that made me laugh, reposted from here: A Proof that P != NP
Proof by contradiction. Assume P = NP. Let y be a proof that P = NP. The proof y can be verified in polynomial time by a competent computer scientist, the existence of which we assert. However, since P = NP, the proof y can be generated in polynomial time by such computer scientists. Since this generation has not yet occurred (despite attempts by such computer scientists to produce a proof), we have a contradiction.
And then, browsing that site a little bit, I came across an even shinier gem! Jan Johannsen’s cute title collection
There’s far too many to post here, but some of my favorites include:
- Scott is not Always Sober. By Peter T. Johnstone, in Continuous lattices, Lecture Notes in Mathematics, 871 (1981), pp. 282—283.
- The Art of Pointless Thinking: a Student’s Guide to the Category of Locales. By Peter T. Johnstone, in Category theory at work, Research and Exposition in Mathematics 18 (1991), pp. 85-107.
- Mick Gets Some (the Odds Are on His Side). By Vasek Chvátal and Bruce Reed, in Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science (1992), pp. 620-627.
- Lively Linear Lisp – ‘Look Ma, No Garbage!’ By Henry G. Baker, in ACM SIGPLAN Notices
- A Bit of Abstinence (Provably) Promotes Satisfaction. By Dimitris Achlioptas and Chris Moore, in the 5th International Symposium on the Theory and Applications of Satisfiability Testing (SAT 2002).
- Do Not Read This. By Juan Bicarregui, in FME 2002: Formal Methods – Getting IT Right, International Symposium of Formal Methods Europe, 2002, Proceedings. Springer LNCS 2391.