A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Curiouser and Curiouser: The Link between Incompressibility and Complexity
[chapter]

2012
*
Lecture Notes in Computer Science
*

This talk centers around some audacious conjectures that attempt to forge firm links between computational complexity classes and the study of Kolmogorov complexity. More specifically, let R denote the set of Kolmogorov-random strings. Let BPP denote the class of problems that can be solved with negligible error by probabilistic polynomial-time computations, and let NEXP denote the class of problems solvable in nondeterministic exponential time. Conjecture 1: NEXP = NP R . Conjecture 2: BPP is

doi:10.1007/978-3-642-30870-3_2
fatcat:ofl5kpdavrfqxfar5gkla6erdi