Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Math | A heuristic that moves the target of a search to the root of the search tree so it is found faster next time. (references) |
Source: compiled by the editor from various references; see credits. | |
Hexadecimal (or equivalents, 770AD-1900s) (references)4D 4F 56 45 2D 54 4F 2D 52 4F 4F 54 48 45 55 52 49 53 54 49 43 |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01001101 01001111 01010110 01000101 00101101 01010100 01001111 00101101 01010010 01001111 01001111 01010100 00100000 01001000 01000101 01010101 01010010 01001001 01010011 01010100 01001001 01000011 |
HTML Code (1990) (references)M O V E - T O - R O O T   H E U R I S T I C |
ISO 10646 (1991-1993) (references)004D 004F 0056 0045 002D 0054 004F 002D 0052 004F 004F 0054 0048 0045 0055 0052 0049 0053 0054 0049 0043 |
Encryption (beginner's substitution cypher): (references)4749563915544915524949542423955524353544337 |
| 1. Orthography 2. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
