Curiouser and Curiouser: The Link between Incompressibility and Complexity

Abstract

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… (More)
DOI: 10.1007/978-3-642-30870-3_2

Topics

Cite this paper

@inproceedings{Allender2012CuriouserAC, title={Curiouser and Curiouser: The Link between Incompressibility and Complexity}, author={Eric Allender}, booktitle={CiE}, year={2012} }