911 search results - page 4 / 183 » Kolmogorov Complexity Cores |
119
Voted
JCSS
2011
14 years 8 months ago
2011
STOC
2002
ACM
16 years 2 months ago
2002
ACM
101
click to vote
FSTTCS
2001
Springer
15 years 6 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...
112
Voted
CORR
2010
Springer
15 years 1 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...
109
click to vote
DLT
2009
14 years 11 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...