On Kolmogorov Complexity of Random Very Long Braided Words

Posted on Posted in Theory

http://arxiv.org/abs/1308.0211v2 Any positive word comprised of random sequence of tokens form a finite alphabet can be reduced (without change of length) using an appropriate size Braid group relationships. Surprisignly the Braid relations dramatically reduce the Kolmogorov Complexity of the original random word and do so in distinct bands of (rate of change) values with gaps […]