Oxford University Press, London, 1988. If we treat bit encoded descriptions as though they were the outcome of repeatedly tossing an unbiased coin, the prior probability of a string of bits s of length l is simply 2 Gammal . Logical depth and physical complexity . Kammerer and Unverzagt, Hamburg, 1988. However, a given quantity of information may be organized in various ways, rendering it more or less useful for various computational purposes.
Precise definitions appear in the sections to follow.
Logical depth and physical complexity . Oxford University Press, 1988. We must therefore look to some alternative model to guide and constrain the search through this more complex lattice. Logical depth and physical complexity . Kammerer and Unverzagt, Hamburg, 1988.