Sciweavers

879 search results - page 1 / 176
» Kolmogorov Complexity and Model Selection
Sort
View
CORR
2011
Springer
172views Education» more  CORR 2011»
12 years 10 months ago
Possibilities and impossibilities in Kolmogorov complexity extraction
Randomness extraction is the process of constructing a source of randomness of high quality from one or several sources of randomness of lower quality. The problem can be modeled ...
Marius Zimand
STOC
2002
ACM
105views Algorithms» more  STOC 2002»
14 years 3 months ago
Approximating the smallest grammar: Kolmogorov complexity in natural models
Moses Charikar, Eric Lehman, Ding Liu, Rina Panigr...
JSYML
2007
95views more  JSYML 2007»
13 years 3 months ago
Applications of Kolmogorov complexity to computable model theory
In this paper we answer the following well-known open question in computable model theory. Does there exist a computable not ℵ0-categorical saturated structure with a unique com...
Bakhadyr Khoussainov, Pavel Semukhin, Frank Stepha...
CIE
2006
Springer
13 years 7 months ago
Lower Bounds Using Kolmogorov Complexity
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...
Sophie Laplante