Ranter
Join devRant
Do all the things like
++ or -- rants, post your own rants, comment on others' rants and build your customized dev avatar
Sign Up
Pipeless API
From the creators of devRant, Pipeless lets you power real-time personalized recommendations and activity feeds using a simple API
Learn More
Comments
-
beleg31407y@Raamakrishnan in algorithmic information theory, the complexity of a string is measured by the length of (the code of) the smallest Turing machine that outputs it, in proportion to its length. So you can suppose the code of this Turing machine as the maximal compression of that string, because it contains the information content of the string in a smaller length. By this definition, a string has maximum complexity if any Turing machine outputing that string has a length bigger than, or equal to the original string, modulo a constant, i.e. you can't have an algorithm print it unless you hardcode it into the algorithm. Such string is considered "random" from AIT point of view.
For more information, see: https://en.m.wikipedia.org/wiki/... -
coolq48207yI thought the lower the percentage, the smaller it is?
Like 40% means it's 60% smaller? So what's 0% then? Nothing?
So then what I said can't be true on your platform, sizes are exactly the same.
Related Rants
Then what is the use of compression?
PS: the file list goes on...
undefined
compression
zip