Kolmogorov Complexity

In algorithmic information theory the Kolmogorov complexity of an object, such as a piece of text, is the length of the shortest computer program that produces the object as output.

Link

Leave a Reply

Your email address will not be published. Required fields are marked *