Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Computing | Boundedly complete In domain theory, a complete partial order is boundedly complete if every bounded subset has a least upper bound. Also called consistently complete. Source: The Free On-line Dictionary of Computing. |
Source: compiled by the editor from various references; see credits. | |
Crosswords: BOUNDEDLY COMPLETE |
| Specialty definitions using "BOUNDEDLY COMPLETE": complete partial ordering, consistently complete ♦ Scott domain. (references) |
Scrabble® YAWL-Verified Anagrams | |
| Words within the letters "b-c-d-d-e-e-e-l-l-m-n-o-o-p-t-u-y" | |
-5 letters: duodenectomy. | |
| 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)42 4F 55 4E 44 45 44 4C 59 43 4F 4D 50 4C 45 54 45 |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01000010 01001111 01010101 01001110 01000100 01000101 01000100 01001100 01011001 00100000 01000011 01001111 01001101 01010000 01001100 01000101 01010100 01000101 |
HTML Code (1990) (references)B O U N D E D L Y   C O M P L E T E |
ISO 10646 (1991-1993) (references)0042 004F 0055 004E 0044 0045 0044 004C 0059 0043 004F 004D 0050 004C 0045 0054 0045 |
Encryption (beginner's substitution cypher): (references)36495548383938465923749475046395439 |
| 1. Crosswords 2. Anagrams 3. Orthography 4. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
