The ratio of the actual Kolmogorov complexity to the superficially apparent Kolmogorov complexity? By the way...Wikipedia has something on a "naive" attempt to

The ratio of the actual Kolmogorov complexity to the superficially apparent Kolmogorov complexity? By the way...Wikipedia has something on a "naive" attempt to compute the Kolmogorov complexity of a string. It says that iterating through all strings won't work because some of them contain infinite loops and the halting problem is uncomputable. Ok, but what if you make a program to test all possible strings in "parallel", that is, on a sequential processor, but using brief time slices? That way, shouldn't you finish with all the strings that halt without letting the infinite loops hold things up? I probably don't understand something or am plagiarizing something I've forgotten, or both.