Copyright © Philip M. Parker, INSEAD. Terms of Use.

Crosswords: NONDETERMINISTIC TURING MACHINE |
| Specialty definitions using "NONDETERMINISTIC TURING MACHINE": alternating Turing machine ♦ existential state ♦ nondeterministic automaton, NP-complete, NP-hard. (references) |
Source: compiled by the editor from various references; see credits. |
| Domain | Definition |
Computing | Nondeterministic Turing Machine |
Math | A Turing machine which has more than one next state for some combinations of contents of the current cell and current state. An input is accepted if any move sequence leads to acceptance. (references) |
Source: compiled by the editor from various references; see credits. | |
Hexadecimal (or equivalents, 770AD-1900s) (references)4E 4F 4E 44 45 54 45 52 4D 49 4E 49 53 54 49 43      54 55 52 49 4E 47      4D 41 43 48 49 4E 45 |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01001110 01001111 01001110 01000100 01000101 01010100 01000101 01010010 01001101 01001001 01001110 01001001 01010011 01010100 01001001 01000011 00100000 01010100 01010101 01010010 01001001 01001110 01000111 00100000 01001101 01000001 01000011 01001000 01001001 01001110 01000101 |
HTML Code (1990) (references)N O N D E T E R M I N I S T I C   T U R I N G   M A C H I N E |
ISO 10646 (1991-1993) (references)004E 004F 004E 0044 0045 0054 0045 0052 004D 0049 004E 0049 0053 0054 0049 0043      0054 0055 0052 0049 004E 0047      004D 0041 0043 0048 0049 004E 0045 |
Encryption (beginner's substitution cypher): (references)484948383954395247434843535443372545552434841247353742434839 |
| 1. Crosswords 2. Orthography 3. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.