Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Math | The problem of finding an edit script of minimum cost which transforms a given forest into another given forest. (references) |
Source: compiled by the editor from various references; see credits. | |
Hexadecimal (or equivalents, 770AD-1900s) (references)46 4F 52 45 53 54 45 44 49 54 49 4E 47 50 52 4F 42 4C 45 4D |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01000110 01001111 01010010 01000101 01010011 01010100 00100000 01000101 01000100 01001001 01010100 01001001 01001110 01000111 00100000 01010000 01010010 01001111 01000010 01001100 01000101 01001101 |
HTML Code (1990) (references)F O R E S T   E D I T I N G   P R O B L E M |
ISO 10646 (1991-1993) (references)0046 004F 0052 0045 0053 0054 0045 0044 0049 0054 0049 004E 0047 0050 0052 004F 0042 004C 0045 004D |
Encryption (beginner's substitution cypher): (references)404952395354239384354434841250524936463947 |
| 1. Orthography 2. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
