Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Math | Given a set of pairs of strings, find a sequence of pairs such that the concatenation of all first members of the pairs is the same string as the concatenation of all second members. This is an undecidable problem. (references) |
Source: compiled by the editor from various references; see credits. | |
Hexadecimal (or equivalents, 770AD-1900s) (references)50 4F 53 54 27 53 43 4F 52 52 45 53 50 4F 4E 44 45 4E 43 45 50 52 4F 42 4C 45 4D |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01010000 01001111 01010011 01010100 00100111 01010011 00100000 01000011 01001111 01010010 01010010 01000101 01010011 01010000 01001111 01001110 01000100 01000101 01001110 01000011 01000101 00100000 01010000 01010010 01001111 01000010 01001100 01000101 01001101 |
HTML Code (1990) (references)P O S T ' S   C O R R E S P O N D E N C E   P R O B L E M |
ISO 10646 (1991-1993) (references)0050 004F 0053 0054 0027 0053 0043 004F 0052 0052 0045 0053 0050 004F 004E 0044 0045 004E 0043 0045 0050 0052 004F 0042 004C 0045 004D |
Encryption (beginner's substitution cypher): (references)5049535495323749525239535049483839483739250524936463947 |
| 1. Orthography 2. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
