Revision as of 15:52, 21 October 2007 edit Rp (talk \| contribs) Extended confirmed users 2,953 edits m →Reverted edit ← Previous edit		Revision as of 20:15, 30 March 2009 edit undo Rp (talk \| contribs) Extended confirmed users 2,953 edits →Is "nondeterministic algorithm" and "probabilistic deterministic algorithm" the same? Next edit →
Line 11: 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~~choices are possible, you also give the likelihood for each of the choices to be made. [[User:Rp\|Rp]] 18:54, 19 October 2007 (UTC) :: I removed another sentence from that example which maintained the suggestion that nondeterminism and random choice are the same. [[User:Rp\|Rp]] ([[User talk:Rp\|talk]]) 20:15, 30 March 2009 (UTC) ==Merge==

Talk:Nondeterministic algorithm: Difference between revisions