fun:bowel generated the paper whose abstract is pasted here.

It's complete nonsense, but I've mirrored it here on the wiki for your viewing pleasure.

Symbiotic information and the producer-consumer problem have garnered minimal interest from both mathematicians and information theorists in the last several years. After years of private research into thin clients, we prove the exploration of the Turing machine. In this paper, we show not only that RAID can be made read-write, pervasive, and concurrent, but that the same is true for RAID.

  • fun/bowel.txt
  • Last modified: 2016/11/27 00:26
  • by ellenor2000