However, "s" is also described by a program of length "U" + log2("n"0) + "C", so its complexity is less than "n"0.
Однако "s" может быть описана программой длины "U" + log2("n"0) + "C", значит ее сложность меньше "n"0.