ConceptNondeterministic Algorithm
Nondeterministic Algorithm
In computability theory, a theoretical model that permits choices among multiple possible steps, commonly used to define complexity classes such as NP; it is not an actually executable algorithm.
Timeline (last 90 days)
Oct 20
Yuri Gurevich puts forward the core argument: a true algorithm is always deterministic, and so-called "non-determinism" is merely the result of the algorithm obtaining information through an external "oracle".
Unverified50%