On Kolmogorov Complexity of Hard Sets 1

Abstract

There are two main informal ideas related to informational content of hard sets. The first says that a set of low informational content can not be hard or complete for a great enough complexity class because of lack of information accessible with bounded resources. One of the formalizatio