Things to include:
- Chaos-to-Order Software
- Applied Combinatorial Optimization Software
- Computer Assisted
Text Assembly (CATA)
The idea of something which might be called System Liebniz is based on a single visual image, that of the large bookshelf full of the collected works of Gottfied Wilhelm von Leibniz, who hardly ever finished or published anything himself. I’m like him in that way (the never finishing or publishing part, sad to say, not the bookshelf part), having written hundreds of thousands of words and thousands of computer programs with almost nothing visible to show for it all.
System Liebniz should perhaps be named instead for one of the obscure scholars who took such care of the great man’s papers and turned them into finely bound books. It is intended to do that work for us all, to maximize our high-quality output, even if all we produce is unfinished, unpolished, and an unsightly mishmash of ideas, piece of text, or snippets of source code.
Even the implacable leader of the hostile anti-SNO forces (who happens to be my oldest and best friend) should be able to accept System Liebniz for what it is. Although this new system is rooted firmly in the SNO idea-conglomeration, it is purely and simply a software tool without a trace of social manipulation to it. The key to this system is the clever use of known methods for the solution of Inverse Problems. Order-to-Chaos is easy, just hand over the printed volumes to a four-year-old child, who might choose to employ the aid of the-dog-who-ate-my-homework. It is Chaos-to-Order that is hard. Given the Leibnizian pile of scrap paper, notes on envelope-backs, scribbles in margins, now produce for us the printed volumes of our Collected Works. That sounds impossible, perhaps, but it’s not anywhere near as difficult as the more familiar inverse problems of public-key encryption system code-breaking. The whole idea of public-key cryptography is that, while encryption is simple, (as is decryption, if you have the key), the true inverse problem of decryption without the key is effectively impossible — though remaining possible in theory. In contrast, it seems, making bound-volume-order out of childish-mayhem text-collections is a cinch.
But how does it actually work? What’s the algorithm?
Text Assembly as a Combinatorial Optimization Problem
Finnegans Wake ReUnDeConstructed
for more information. Other new pages and links to relevant academic sites to come … ( peek at a few now ) Copyright © 2001 Douglas P. Wilson