Noun
non-determinism (countable and uncountable, plural non-determinisms)
Alternative form of nondeterminism
Bounded non-determinism An NTM has the property of bounded non-determinism, i.e., if an NTM always halts on a given input tape T then it halts in a bounded number of steps, and therefore can only have a bounded number of possible configurations. Source: Internet
In particular, Prolog's non-deterministic evaluation strategy can be problematic when programming deterministic computations, or when even using "don't care non-determinism" (where a single choice is made instead of backtracking over all possibilities). Source: Internet
The language, with its reliance on non-determinism, the adopted weakest precondition semantics and the proposed development method has had a considerable impact on the field to this day. Source: Internet
Writing P for a power domain constructor, the domain P(D) is the domain of non-deterministic computations of type denoted by D. There are difficulties with fairness and unboundedness in domain-theoretic models of non-determinism. Source: Internet