Compressibility (computer science)

In computer science a computable object such as a bitstring of size n is called compressible if there is computer program or algorithm that computes the bitstring but has fewer than n bits. The theory of Kolmogorov complexity is concerned with the shortest algorithms for computable objects.

This computer science-related article is a stub. You can help Wikipedia by expanding it.