Revision as of 08:42, 18 October 2007 edit Sam Staton (talk \| contribs) Extended confirmed users, Rollbackers 1,031 edits Explanation ← Previous edit		Revision as of 18:54, 19 October 2007 edit undo Rp (talk \| contribs) Extended confirmed users 2,953 edits m →Is "nondeterministic algorithm" and "probabilistic deterministic algorithm" the same? Next edit →
Line 8: 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? : It is not the same thing. A probabilistic algorithm is an algorithm in which nondeterminism is resolved by the use of probability. You don't just say that multiple chhoices are possible, you also give the likelihood for each of the choices to be made. [[User:Rp\|Rp]] 18:54, 19 October 2007 (UTC) ==Merge==

Talk:Nondeterministic algorithm: Difference between revisions