Random problems (Q1113868)

A problem (a Boolean function \(f:\{0,1\}^ N\to \{0,1\})\) is characterized by its randomness (à la Kolmogorov) R(f) and its entropy (à la Shannon) H(f). Random problems have large values of R(f) and are a good model for many natural pattern recognition problems. R(f) and H(f) are shown to be lower and upper bounds, respectively, for a minimum-size circuit that computes f. False entropy, namely the hidden structure of a problem, is related to the difference between H(f) and R(f).