Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Math | Given types of items of different values and volumes, find the most valuable set of items that fit in a knapsack of fixed volume. The number of items of each type is unbounded. This is an NP-hard combinatorial optimization problem. (references) |
Source: compiled by the editor from various references; see credits. | |
Crosswords: UNCOMPUTABLE FUNCTION |
| Specialty definitions using "UNCOMPUTABLE FUNCTION": unsorted list. (references) |
Hexadecimal (or equivalents, 770AD-1900s) (references)55 4E 43 4F 4D 50 55 54 41 42 4C 45 46 55 4E 43 54 49 4F 4E |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01010101 01001110 01000011 01001111 01001101 01010000 01010101 01010100 01000001 01000010 01001100 01000101 00100000 01000110 01010101 01001110 01000011 01010100 01001001 01001111 01001110 |
HTML Code (1990) (references)U N C O M P U T A B L E   F U N C T I O N |
ISO 10646 (1991-1993) (references)0055 004E 0043 004F 004D 0050 0055 0054 0041 0042 004C 0045 0046 0055 004E 0043 0054 0049 004F 004E |
Encryption (beginner's substitution cypher): (references)55483749475055543536463924055483754434948 |
| 1. Crosswords 2. Orthography 3. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
