nondeterminism


Also found in: Wikipedia.

nondeterminism

(algorithm)
A property of a computation which may have more than one result.

One way to implement a nondeterministic algorithm is using backtracking, another is to explore (all) possible solutions in parallel.
References in periodicals archive ?
An alternative, more obvious approach to avoiding the problems of deadlock and nondeterminism would be to provide higher-level constructs as primitives, so that programmers can be assured that a program is deadlock-free and/or deterministic as long as those constructs are used.
We deterministically install the maximum number of constraints on the reals and use the nondeterminism to enumerate all the integers which are to satisfy these constraints.
[1996a]), including CCP with local nondeterminism [Jagadeesan et al.
In addition, current research areas -- such as parallelism, nondeterminism, input/output, and state-oriented computations -- are examined with the goal of predicting the future development and application of functional languages.
If the underlying program defining M is the parallel composition of n sequential processes, where each process exhibits bounded nondeterminism of degree k, then the maximal outdegree of each node in M is kn.
Although the ability to simulate nondeterminism and to complete multiple solutions for a single query is a powerful and attractive feature of logic programming languages, it is expensive in both time and space.
In the presence of nondeterminism, one may be interested to know whether some property holds along some possible execution path.
However, the number of registers never grows; instead, RVG reuses them, thus systematically forgetting many (but not all) ambiguities, This approach puts a tight leash on nondeterminism; it also mimics human behavior.
Computational effects are a feature of programming languages representing impure behaviour, such as input and output operations, exceptions, state, nondeterminism. These operations are widely used in practical programming and are provided by many programming languages.
(2017) show that problems due to nondeterminism in standard benchmark environments and variance intrinsic to AI methods require proper experimental techniques and reporting procedures.
Since resolving nondeterminism in an MDP results in a DTMC, in complementary work [4], Aljazzar and Leue proposed an approach for counterexample generation for MDPs based on existing methods for DTMC.
In the first state, it uses nondeterminism and candidate sampling to achieve high packet delivery ratios probabilistically.

Full browser ?