Revision as of 02:52, 27 April 2010 edit RobinK (talk \| contribs) Extended confirmed users, Pending changes reviewers 3,059 edits →examples: all examples suck ← Previous edit		Revision as of 11:07, 27 April 2010 edit undo CBM (talk \| contribs) Extended confirmed users, File movers, Pending changes reviewers, Rollbackers 55,390 edits →examples: agree Next edit →
Line 49: ::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) :::I agree with that. My only concern is that maybe the term "nondeterministic algorithm" is used more generally in CS, not just referring to automata. — Carl <small>([[User:CBM\|CBM]] · [[User talk:CBM\|talk]])</small> 11:07, 27 April 2010 (UTC)

Talk:Nondeterministic algorithm: Difference between revisions