sentences:  T. Beth and Z-D. Dai purported to show that Kolmogorov complexity and linear complexity are practically the same, although Y. Wang later showed their claims are incorrect.Nevertheless, Wang also demonstrated that for Martin-Löf random sequences, the Kolmogorov complexity is essentially the same as linear complexity.These practical tests make it possible to compare the randomness of strings.