79 search results - page 3 / 16 » Shannon Information and Kolmogorov Complexity |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The causal Markov condition (CMC) is a postulate that links observations to causality. It describes the conditional independences among the observations that are entailed by a cau...
ICALP
2003
Springer
14 years 20 days ago
2003
Springer
Kolmogorov complexity measures the ammount of information in a string as the size of the shortest program that computes the string. The Kolmogorov structure function divides the s...
CEC
2005
IEEE
14 years 1 months ago
2005
IEEE
COCO
2007
Springer
14 years 1 months ago
2007
Springer
Antunes, Fortnow, van Melkebeek and Vinodchandran captured the notion of non-random information by computational depth, the difference between the polynomialtime-bounded Kolmogoro...
MFCS
2004
Springer
14 years 24 days ago
2004
Springer
We study constructive and resource-bounded scaled dimension as an information content measure and obtain several results that parallel previous work on unscaled dimension. Scaled ...