Complexity conditional Kolmogorov

As noted, Kolmogorov complexity has been suggested as a method for measuring specification. The novelty in the method presented here is the use of conditional Kolmogorov complexity. However, this paper also elucidates a number of examples of algorithmic compressibility demonstrating wider applicability than is often realized. 

There is also an extension of Kolmogorov complexity known as conditional Kolmogorov complexity which can be used (Kolmogorov, 1968a). With conditional Kolmogorov complexity, the program now has access to additional data as its input. 

Given different choices of L and N, this program will output any particular folding protein. This means that the protein can be described by providing those two numbers. Thus, the conditional Kolmogorov complexity can be calculated using these two numbers. 

Any element x can be described given the probability distribution and logf x) bits. Given that f x) and F can be calculated with a constant program, the conditional Kolmogorov complexity can be calculated as... 

---