Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Math | The limiting behavior of the execution time of an algorithm when the size of the problem goes to infinity. This is usually denoted in big-O notation. (references) |
Source: compiled by the editor from various references; see credits. | |
Hexadecimal (or equivalents, 770AD-1900s) (references)41 53 59 4D 50 54 4F 54 49 43 54 49 4D 45 43 4F 4D 50 4C 45 58 49 54 59 |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01000001 01010011 01011001 01001101 01010000 01010100 01001111 01010100 01001001 01000011 00100000 01010100 01001001 01001101 01000101 00100000 01000011 01001111 01001101 01010000 01001100 01000101 01011000 01001001 01010100 01011001 |
HTML Code (1990) (references)A S Y M P T O T I C   T I M E   C O M P L E X I T Y |
ISO 10646 (1991-1993) (references)0041 0053 0059 004D 0050 0054 004F 0054 0049 0043 0054 0049 004D 0045 0043 004F 004D 0050 004C 0045 0058 0049 0054 0059 |
Encryption (beginner's substitution cypher): (references)35535947505449544337254434739237494750463958435459 |
| 1. Orthography 2. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
