Algorithmic depth

from Wikipedia, the free encyclopedia

The algorithmic or logical depth is a measure of the complexity of a data volume or message , i.e. the information content . It was defined by Charles Bennett as the effort that must be made to generate or decrypt the data. Formally, it is the time complexity of the most efficient algorithm that can produce this data. In contrast to the otherwise similar Kolmogorow complexity , the runtime for the execution of the algorithm is decisive and not its length.

See also: complexity theory , information , information theory , amount of information , algorithmic information theory