Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Math | The complexity class P captures the true notion of feasible (polynomial time) sequential computation. (references) |
Source: compiled by the editor from various references; see credits. | |
Hexadecimal (or equivalents, 770AD-1900s) (references)50 4F 4C 59 4E 4F 4D 49 41 4C 2D 54 49 4D 45 43 48 55 52 43 48 2D 54 55 52 49 4E 47 54 48 45 53 49 53 |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01010000 01001111 01001100 01011001 01001110 01001111 01001101 01001001 01000001 01001100 00101101 01010100 01001001 01001101 01000101 00100000 01000011 01001000 01010101 01010010 01000011 01001000 00101101 01010100 01010101 01010010 01001001 01001110 01000111 00100000 01010100 01001000 01000101 01010011 01001001 01010011 |
HTML Code (1990) (references)P O L Y N O M I A L - T I M E   C H U R C H - T U R I N G   T H E S I S |
ISO 10646 (1991-1993) (references)0050 004F 004C 0059 004E 004F 004D 0049 0041 004C 002D 0054 0049 004D 0045 0043 0048 0055 0052 0043 0048 002D 0054 0055 0052 0049 004E 0047 0054 0048 0045 0053 0049 0053 |
Encryption (beginner's substitution cypher): (references)5049465948494743354615544347392374255523742155455524348412544239534353 |
| 1. Orthography 2. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
