Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Math | The minimum number of bits into which a string can be compressed without losing information. This is defined with respect to a fixed, but universal decompression scheme, given by a universal Turing machine. (references) |
Source: compiled by the editor from various references; see credits. | |
Crosswords: KOLMOGOROV COMPLEXITY |
| Specialty definitions using "KOLMOGOROV COMPLEXITY": incompressible string. (references) |
Hexadecimal (or equivalents, 770AD-1900s) (references)4B 4F 4C 4D 4F 47 4F 52 4F 56 43 4F 4D 50 4C 45 58 49 54 59 |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01001011 01001111 01001100 01001101 01001111 01000111 01001111 01010010 01001111 01010110 00100000 01000011 01001111 01001101 01010000 01001100 01000101 01011000 01001001 01010100 01011001 |
HTML Code (1990) (references)K O L M O G O R O V   C O M P L E X I T Y |
ISO 10646 (1991-1993) (references)004B 004F 004C 004D 004F 0047 004F 0052 004F 0056 0043 004F 004D 0050 004C 0045 0058 0049 0054 0059 |
Encryption (beginner's substitution cypher): (references)45494647494149524956237494750463958435459 |
| 1. Crosswords 2. Orthography 3. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
