CentralNotice From Wikipedia, the free encyclopedia Jump to: navigation , search Not to be confused with Descriptive complexity theory . This image illustrates part of the Mandelbrot set fractal . Simply storing the 24-bit color of each pixel in this image would require 1.62 million bits, but a small computer program can reproduce these 1.62 million bits using the definition of the Mandelbrot set and the coordinates of the corners of the image. Thus, the Kolmogorov complexity of the raw file encoding this bitmap is much less than 1.62 million bits in any pragmatic model of computation. In algorithmic information theory (a subfield of computer science and mathematics ), the Kolmogorov complexity of an object, such as a piece of text, is the length of the shortest computer program (in a predetermined programming language ) that produces the object as output. It is ...