701 search results - page 4 / 141 » Kolmogorov complexity in perspective |
JCSS
2011
13 years 2 months ago
2011
STOC
2002
ACM
14 years 7 months ago
2002
ACM
FSTTCS
2001
Springer
14 years 23 hour 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 7 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 5 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...