Jump to content

Nondeterministic algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Zuidervled (talk | contribs) at 20:24, 19 May 2004. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Unlike a deterministic algorithm, a nondeterministic algorithm's behavior cannot be predicted simply by examining the inputs. The same inputs may at times produce different behaviors.