4355 search results - page 4 / 871 » Increasing Kolmogorov Complexity |
FSTTCS
2001
Springer
14 years 1 months ago
2001
Springer
This paper has the following goals: – To survey some of the recent developments in the field of derandomization. – To introduce a new notion of time-bounded Kolmogorov complex...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Hartmanis used Kolmogorov complexity to provide an alternate proof of the classical result of Baker, Gill, and Solovay that there is an oracle relative to which P is not NP. We re...
DLT
2009
13 years 6 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...
TIT
2010
13 years 3 months ago
2010
We examine the structure of families of distortion balls from the perspective of Kolmogorov complexity. Special attention is paid to the canonical rate-distortion function of a so...
COCO
2000
Springer
14 years 27 days ago
2000
Springer
Kolmogorov’s very first paper on algorithmic information theory (Kolmogorov, Problemy peredachi infotmatsii 1(1) (1965), 3) was entitled “Three approaches to the definition ...