Nondeterministic algorithm

In the theory of computation, a nondeterministic algorithm is a hypothetical algorithm where computation can branch, choosing among or simultaneously following many different potential execution paths.

In standard usage, in fact, an algorithm means a deterministic algorithm. There are, however, models of computation, such as the nondeterministic finite state machine, that use non-determinism. Randomization is a way of transforming a nondeterministic algorithm into a probabilistic deterministic algorithm.

See Also

This article is licensed under the GNU Free Documentation License. It uses material from Wikipedia article. Browse Wikipedia for more information.