Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Computing | Complete lattice A lattice is a partial ordering of a set under a relation where all finite subsets have a least upper bound and a greatest lower bound. A complete lattice also has these for infinite subsets. Every finite lattice is complete. Some authors drop the requirement for greatest lower bounds. (1994-12-02). Source: The Free On-line Dictionary of Computing. |
Source: compiled by the editor from various references; see credits. | |
Scrabble® Enable2K-Verified Anagrams | |
| Words within the letters "a-c-c-e-e-e-i-l-l-m-o-p-t-t-t" | |
-5 letters: complicate. | |
| 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)43 4F 4D 50 4C 45 54 45 4C 41 54 54 49 43 45 |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01000011 01001111 01001101 01010000 01001100 01000101 01010100 01000101 00100000 01001100 01000001 01010100 01010100 01001001 01000011 01000101 |
HTML Code (1990) (references)C O M P L E T E   L A T T I C E |
ISO 10646 (1991-1993) (references)0043 004F 004D 0050 004C 0045 0054 0045 004C 0041 0054 0054 0049 0043 0045 |
Encryption (beginner's substitution cypher): (references)3749475046395439246355454433739 |
| 1. Anagrams 2. Orthography 3. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
