Revision as of 16:20, 8 October 2007 edit Sam Staton (talk \| contribs) Extended confirmed users, Rollbackers 1,031 edits Merge? ← Previous edit		Revision as of 10:05, 17 October 2007 edit undo Sam Staton (talk \| contribs) Extended confirmed users, Rollbackers 1,031 edits Explanation about revert. Next edit →
Line 11: ==Merge== Can anyone explain why the merge with nondeterminstic programming is a good idea? Or OK if I just remove the merge tags? [[User:Sam Staton\|Sam Staton]] 16:20, 8 October 2007 (UTC) ==Reverted edit== I reverted an edit by an anonymous editor. The sentence "A nondeterministic algorithm as an algorithm that, given the same input, may produce different results." is not true: the important thing about a non-deterministic algorithm is that it may make (nondeterministic) choices during execution. Also the first paragraph, even as it stands, is certainly not a "formal definition". If this is unclear, I'm happy to discuss. [[User:Sam Staton\|Sam Staton]] 10:05, 17 October 2007 (UTC)

Talk:Nondeterministic algorithm: Difference between revisions