Table 7. 20 random strings (sorted from lowest to highest complexity values) from the first half of D(5) to which the coding theorem has been applied (extreme right column) to approximate K(s).

string length	string	complexity ()
11	11011011010	28.1839
12	101101110011	32.1101
12	110101001000	32.1816
13	0101010000010	32.8155
14	11111111100010	34.1572
12	011100100011	34.6045
15	001000010101010	35.2569
16	0101100000000000	35.6047
13	0110011101101	35.8943
15	101011000100010	35.8943
16	1111101010111111	25.1313
18	000000000101000000	36.2568
15	001010010000000	36.7423
15	101011000001100	36.7423
17	10010011010010011	37.0641
21	100110000000110111011	37.0641
14	11000010000101	37.0641
17	01010000101101101	37.4792
29	01011101111100011101111010101	37.4792
14	11111110011110	37.4792