On the combinatorial representation of information

Kolmogorov introduced a combinatorial measure of the information I(x : y) about the unknown value of a variable y conveyed by an input variable x taking a given value x. The paper extends this definition of information to a more general setting where 'x = x' may provide a vaguer description of the possible value of y. As an application, the space P({0, 1}ⁿ) of classes of binary functions f : [n] → {0, 1}, [n] = {1,..., n], is considered where y represents an unknown function t ∈ {0, 1}[ⁿ] and as input, two extreme cases are considered: x = x_Md and x = x_M′d which indicate that t is an element of a set G ⊆ {0, 1}ⁿ that satisfies a property M_d or M′_d respectively. Property M_d (or M′_d) means that there exists an E ⊆ [n], |E| = d, such that |tr_E(G)| = 1 (or 2^d) where tr_E(G) denotes the trace of G on E. Estimates of the information value I(x_Md : t) and I(x_M′d: t) are obtained. When d is fixed, it is shown that I(x_Md : t) ≈ d and I(x _M′d : t) ≈ 1 as n → ∞.