Sciweavers

701 search results - page 22 / 141
» Kolmogorov complexity in perspective
Sort
View
TIT
2010
122views Education» more  TIT 2010»
13 years 2 months ago
Biological information as set-based complexity
The significant and meaningful fraction of all the potential information residing in the molecules and structures of living systems is unknown. Sets of random molecular sequences o...
David J. Galas, Matti Nykter, Gregory W. Carter, N...
CORR
2010
Springer
154views Education» more  CORR 2010»
13 years 7 months ago
Causal Markov condition for submodular information measures
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...
Bastian Steudel, Dominik Janzing, Bernhard Sch&oum...
CORR
2006
Springer
88views Education» more  CORR 2006»
13 years 7 months ago
The Power and Perils of MDL
Practical use of MDL is full of pitfalls in which the practitioners tend to fall head over heels. We analyse the power and the perils in the use of MDL. Generally, the classical a...
Pieter W. Adriaans, Paul M. B. Vitányi
IPL
2007
100views more  IPL 2007»
13 years 7 months ago
Average-case analysis of QuickSort and Binary Insertion Tree height using incompressibility
We study the Kolmogorov complexity of a Binary Insertion Tree, and present a succinct encoding scheme for Binary Insertion Trees produced from incompressible permutations. Based o...
Brendan Lucier, Tao Jiang, Ming Li
CORR
2000
Springer
116views Education» more  CORR 2000»
13 years 7 months ago
Algorithmic Statistics
While Kolmogorov complexity is the accepted absolute measure of information content of an individual finite object, a similarly absolute notion is needed for the relation between a...
Péter Gács, John Tromp, Paul M. B. V...