Adjective
nondeterministic (not comparable)
(computer science) Exhibiting nondeterminism; involving choices between indistinguishable possibilities.
Nondeterministic bottom-up tree automaton recognize the class of regular tree languages.
A nondeterministic automaton may have unlabeled or duplicate out-edges for any state, giving more than one successor for some input letter. Source: Internet
In general pushdown automata are nondeterministic meaning that in a given instantaneous description there may be several possible steps. Source: Internet
It is complete for US, the complexity class describing problems solvable by a non-deterministic polynomial time Turing machine that accepts when there is exactly one nondeterministic accepting path and rejects otherwise. Source: Internet
Conversely, suppose we have a nondeterministic TM called A accepting a given language L. At each of its polynomially many steps, the machine's computation tree branches in at most a finite number of directions. Source: Internet
Equivalence with DTMs In particular, nondeterministic Turing machines are equivalent with deterministic Turing machines. Source: Internet
For example, there is a bound on the size of integer that can be computed by an always-halting nondeterministic Turing machine starting on a blank tape. Source: Internet