Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Math | A variant of divide and conquer in which subproblems created in the "divide" step are merged before the "conquer" step. (references) |
Source: compiled by the editor from various references; see credits. | |
Hexadecimal (or equivalents, 770AD-1900s) (references)44 49 56 49 44 45 41 4E 44 4D 41 52 52 49 41 47 45 42 45 46 4F 52 45 43 4F 4E 51 55 45 53 54 |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01000100 01001001 01010110 01001001 01000100 01000101 00100000 01000001 01001110 01000100 00100000 01001101 01000001 01010010 01010010 01001001 01000001 01000111 01000101 00100000 01000010 01000101 01000110 01001111 01010010 01000101 00100000 01000011 01001111 01001110 01010001 01010101 01000101 01010011 01010100 |
HTML Code (1990) (references)D I V I D E   A N D   M A R R I A G E   B E F O R E   C O N Q U E S T |
ISO 10646 (1991-1993) (references)0044 0049 0056 0049 0044 0045 0041 004E 0044 004D 0041 0052 0052 0049 0041 0047 0045 0042 0045 0046 004F 0052 0045 0043 004F 004E 0051 0055 0045 0053 0054 |
Encryption (beginner's substitution cypher): (references)384356433839235483824735525243354139236394049523923749485155395354 |
| 1. Orthography 2. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
