The BWT seems rather mysterious until one recognizes it as a specific kind of permutation that not only yields longer run lengths of symbols but happens to have a short algorithm when compared to all permutations that yield longer run lengths. But then one realizes that is *precisely* the mystery here:
Out of all the possible permutations that yield long run lengths how does one hunt down those that have short algorithms? Is there a higher level language -- the language of permutations -- in which one can describe them? I mean here to say not just the permutation sublanguage of rotations but all such sublanguages. Has the space of programs written in this language been explored in any principled way for superior superior alternative to BWT? ------------------------------------------ Artificial General Intelligence List: AGI Permalink: https://agi.topicbox.com/groups/agi/T56d8c6758403c8e0-Mc72b1f948f6ac3f205a021e2 Delivery options: https://agi.topicbox.com/groups/agi/subscription
