Revision as of 21:36, 26 April 2010 edit 71.146.86.179 (talk) →examples: new section ← Previous edit		Revision as of 23:59, 26 April 2010 edit undo CBM (talk \| contribs) Extended confirmed users, File movers, Pending changes reviewers, Rollbackers 55,390 edits →examples: c Next edit →
Line 45: Examples 2-4 leave a reader with no clue why they describe nondeterministic algorithms, each for its own reason I don't even want to start explaining. Is there an expert in the subject who can do a decent job here? :I don't think of merge sort as a nondeterministic algorithm at all. Example #4 is an algorithm, but not for the problem described. I'm a logician though, not a computer scientist, and they are known to be sufficiently bad with they terminology that I am reluctant to edit too much without having reference to a CS text, which I don't. — Carl <small>([[User:CBM\|CBM]] · [[User talk:CBM\|talk]])</small> 23:59, 26 April 2010 (UTC)

Talk:Nondeterministic algorithm: Difference between revisions