Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Computing | Provably difficult The set or property of problems for which it can be proven that no polynomial-time algorithm exists, only exponential-time algorithms. Source: The Free On-line Dictionary of Computing. |
Source: compiled by the editor from various references; see credits. | |
Scrabble® YAWL-Verified Anagrams | |
| Words within the letters "a-b-c-d-f-f-i-i-l-l-o-p-r-t-u-v-y" | |
-5 letters: dioptrically. | |
| Source: compiled by the editor from various references; see credits. SCRABBLE® is a registered trademark. All intellectual property rights in and to the game are owned in the U.S.A and Canada by Hasbro Inc., and throughout the rest of the world by J.W. Spear & Sons Limited of Maidenhead, Berkshire, England, a subsidiary of Mattel Inc. Mattel and Spear are not affiliated with Hasbro. | |
Hexadecimal (or equivalents, 770AD-1900s) (references)50 52 4F 56 41 42 4C 59 44 49 46 46 49 43 55 4C 54 |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01010000 01010010 01001111 01010110 01000001 01000010 01001100 01011001 00100000 01000100 01001001 01000110 01000110 01001001 01000011 01010101 01001100 01010100 |
HTML Code (1990) (references)P R O V A B L Y   D I F F I C U L T |
ISO 10646 (1991-1993) (references)0050 0052 004F 0056 0041 0042 004C 0059 0044 0049 0046 0046 0049 0043 0055 004C 0054 |
Encryption (beginner's substitution cypher): (references)50524956353646592384340404337554654 |
| 1. Anagrams 2. Orthography 3. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
