Algorithmic Prefix Complexity
While the development of an algorithmic theory of complexity according to the original definitions (plain Kolmogorov complexity) in Chapter 2 was very fruitful, in certain ways the mathematical framework is not yet satisfactory. This has resulted in a plethora of proposals of modified measures to get rid of one or the other problem. Let us list a few conspicuous inconveniences.
KeywordsEntropy Compressibility Prefix Fermat Univer
Unable to display preview. Download preview PDF.