Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Math | An asymptotic bound, as function of the size of the input, on the worst (slowest, most amount of space used, etc.) an algorithm will do to solve a problem. That is, no input will cause the algorithm to use more resources than the bound. (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 55 50 50 45 52 42 4F 55 4E 44 |
| 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 01010101 01010000 01010000 01000101 01010010 00100000 01000010 01001111 01010101 01001110 01000100 |
HTML Code (1990) (references)A S Y M P T O T I C   U P P E R   B O U N D |
ISO 10646 (1991-1993) (references)0041 0053 0059 004D 0050 0054 004F 0054 0049 0043 0055 0050 0050 0045 0052 0042 004F 0055 004E 0044 |
Encryption (beginner's substitution cypher): (references)355359475054495443372555050395223649554838 |
| 1. Orthography 2. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
