84 search results - page 1 / 17 » Kolmogorov complexity and set theoretical representations of... |
MLQ
2006
13 years 5 months ago
2006
MFCS
2004
Springer
13 years 10 months 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 ...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
DLT
2009
13 years 3 months ago
2009
We show here how to construct a cellular automaton whose asymptotic set (the set of configurations it converges to) is maximally complex: it contains only configurations of maximal...
ICALP
2007
Springer
13 years 11 months ago
2007
Springer
While data compression and Kolmogorov complexity are both about effective coding of words, the two settings differ in the following respect. A compression algorithm or compressor...