Revision as of 08:42, 4 May 2010 edit Rp (talk \| contribs) Extended confirmed users 2,953 edits →examples ← Previous edit		Revision as of 11:32, 4 May 2010 edit undo CBM (talk \| contribs) Extended confirmed users, File movers, Pending changes reviewers, Rollbackers 55,390 edits →examples: r Next edit →
Line 55: ::::: If you want to write an article about nondeterministic automata, call it '''Nondeterministic automaton'''. If you think the examples are wrong, improve them or at least explain what's wrong so it can be fixed by others. [[User:Rp\|Rp]] ([[User talk:Rp\|talk]]) 08:42, 4 May 2010 (UTC) ::::::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)

Talk:Nondeterministic algorithm: Difference between revisions