Revision as of 23:59, 26 April 2010 edit CBM (talk \| contribs) Extended confirmed users, File movers, Pending changes reviewers, Rollbackers 55,390 edits →examples: c ← Previous edit		Revision as of 02:52, 27 April 2010 edit undo RobinK (talk \| contribs) Extended confirmed users, Pending changes reviewers 3,059 edits →examples: all examples suck Next edit →
Line 47: :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) ::I think all the examples on the page are terrible. Can we just delete all of them? None of them seem to exhibit nondeterminism in the sense of [[nondeterministic Turing machines]] or a [[nondeterministic finite-state machine]]. --[[User:RobinK\|Robin]] ([[User talk:RobinK\|talk]]) 02:52, 27 April 2010 (UTC)

Talk:Nondeterministic algorithm: Difference between revisions