Revision as of 11:32, 4 May 2010 edit CBM (talk \| contribs) Extended confirmed users, File movers, Pending changes reviewers, Rollbackers 55,390 edits →examples: r ← Previous edit		Revision as of 07:58, 8 June 2010 edit undo Rp (talk \| contribs) Extended confirmed users 2,953 edits →examples Next edit →
Line 57: ::::::I can tell you what I think is wrong: I have never heard the word "nondeterministic algorithm" used to specify an algorithm that is simply underdefined, as in the merge sort example on this article. As far as I can tell, with the way this article uses its terminology, "put the elements in order" is an example of a nondeterministic sort algorithm. Compare the "shopping list" example. It's hard for me to call these "algorithms" in any sense. — Carl <small>([[User:CBM\|CBM]] · [[User talk:CBM\|talk]])</small> 11:32, 4 May 2010 (UTC) :::::::I think you have a point - the term isn't commonly used in such a wide sense. But I can't see how to make a good definition that would exclude such examples. [[User:Rp\|Rp]] ([[User talk:Rp\|talk]]) 07:58, 8 June 2010 (UTC)

Talk:Nondeterministic algorithm: Difference between revisions