> I think I once read that only an exponentially small fraction of binary strings are valid BLC programs This is true for the encoded lambda calculus prefix; b

> I think I once read that only an exponentially small fraction of binary strings are valid BLC programs This is true for the encoded lambda calculus prefix; but not for the entire BLC program in which you can embed arbitrary binary data. > In theory this means you could create shorter programs Not really; BLC is universal, so program sizes are optimal up to a constant. In other words, for any language L, there's a constant c_L, such that for all x, the complexity of x according to BCL is at most a c_L larger than the complexity of x according to L.