Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Computing | Compactness preserving In domain theory, a function f is compactness preserving if f c is compact whenever c is. (1995-01-13). Source: The Free On-line Dictionary of Computing. |
Source: compiled by the editor from various references; see credits. | |
Hexadecimal (or equivalents, 770AD-1900s) (references)43 4F 4D 50 41 43 54 4E 45 53 53 50 52 45 53 45 52 56 49 4E 47 |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01000011 01001111 01001101 01010000 01000001 01000011 01010100 01001110 01000101 01010011 01010011 00100000 01010000 01010010 01000101 01010011 01000101 01010010 01010110 01001001 01001110 01000111 |
HTML Code (1990) (references)C O M P A C T N E S S   P R E S E R V I N G |
ISO 10646 (1991-1993) (references)0043 004F 004D 0050 0041 0043 0054 004E 0045 0053 0053 0050 0052 0045 0053 0045 0052 0056 0049 004E 0047 |
Encryption (beginner's substitution cypher): (references)3749475035375448395353250523953395256434841 |
| 1. Orthography 2. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
