Logical depth is a measure of complexity devised by Charles H. Bennett based on the computational complexity of an algorithm that can recreate a given piece of information. It differs from Kolmogorov complexity in that it considers the computation time of the algorithm with the shortest length, rather than its length. == See also == ...
Found on
http://en.wikipedia.org/wiki/Logical_depth
A measure of the complexity of a system, developed by the American computer scientist and mathematician Charles Bennett. It contrasts with another such measure, algorithmic complexity, but, like it, is a measure of the algorithms needed to generate the data from a system.
Found on
http://www.daviddarling.info/encyclopedia/L/logical_depth.html
No exact match found.
