On the Evaluation of XML

There is a paper authored by Rullsenberg and Cloud called On the Evaluation of XML. Here's the abstract:

Many leading analysts would agree that, had it not been for permutable algorithms, the visualization of extreme programming might never have occurred [2]. Given the current status of extensible algorithms, researchers clearly desire the improvement of agents, which embodies the typical principles of cyberinformatics. In this work, we disprove not only that the famous pseudorandom algorithm for the analysis of the memory bus is in Co-NP, but that the same is true for lambda calculus.

The authors are willing to answer questions on their (ahem) work.

(Hat tip: Norm)