<theory> (Or "probabilistic automaton") An automaton in which there are several possible actions (outputs and next states) at each state of the computation such that the overall course of the computation is not completely determined by the program, the starting state, and the initial inputs.
See also nondeterministic Turing Machine.
Last updated: 1996-05-07
Try this search on Wikipedia, OneLook, Google
Nearby terms: non-algorithmic procedure « nondeterminism « nondeterministic « nondeterministic automaton » nondeterministic polynomial time » Nondeterministic Turing Machine » non-impact printer