What was I thinking? Maybe I should just delete it all to spare myself the embarrassment. In any case, this is an information-theory fanblog now! Gender?—I barely _know_ her.
-[start by saying it takes 40 bits, then introduce the mass function that lets you compresss]
-
Let _V_ be a random variable over the sample space {0,1}<sup>20</sup>, the twenty-dimensional space of binary vectors, and suppose that P(V = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]) = ½, P(V = [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]), and P(_V_ = _v_) = 0 for all other _v_ ∈ {0,1}<sup>20</sup>.