Talk:Nondeterministic algorithm

This is an old revision of this page, as edited by SatyrBot (talk | contribs) at 06:32, 31 July 2007 (SatyrBot auto-adding tag to talk page. See User:SatyrBot/Current project). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Latest comment: 18 years ago by 172.133.246.35 in topic In need of massive work

Template:Logic2

In the intro, "a nondeterministic algorithm is an algorithm with one or more choice points where multiple different continuations are possible". What's a choice point? What's a continuation?

In need of massive work

Wow, there's about 1.2 zillion different types of nondeterministic algorithms (if you include things like stochastic methods, etc). This article is in need of serious attention. Perhaps I'll have to see to that! - 172.133.246.35 06:42, 2 December 2006 (UTC) (JustinWick)Reply

Is "nondeterministic algorithm" and "probabilistic deterministic algorithm" the same?

In the example "Primality testing" the "Guess an integer..." part of a concrete program/implementation can only use a random number generator to get the job done. Does this mean, that "nondeterministic" and "probabilistic deterministic" are the same in this instance?