= Logical depth
{wiki=Logical_depth}
Logical depth is a concept introduced by computer scientist Charles H. Bennett in the context of algorithmic information theory and computational complexity. It represents a measure of the complexity of a string or a piece of information based on the amount of computational effort needed to produce it from a simpler description. In more formal terms, logical depth is defined as follows: 1. **Compression**: A string or object can often be represented more compactly by some form of algorithm or Turing machine.
Back to article page