Revision as of 11:07, 27 April 2010 edit CBM (talk \| contribs) Extended confirmed users, File movers, Pending changes reviewers, Rollbackers 55,390 edits →examples: agree ← Previous edit		Revision as of 13:06, 27 April 2010 edit undo RobinK (talk \| contribs) Extended confirmed users, Pending changes reviewers 3,059 edits →examples Next edit →
Line 51: :::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) ::::I checked the incoming links to the page, and it looks like there are two different meanings of the words "non-determinism" that both link to this page. The first is in the sense of non-deterministic TMs, and the second meaning seems to be anything that is not deterministic (which could mean a random choice, or a choice where the user is not told how the choice is made). This page should probably then reflect these two meanings, or have one of them redirect to a different page. --[[User:RobinK\|Robin]] ([[User talk:RobinK\|talk]]) 13:06, 27 April 2010 (UTC)

Talk:Nondeterministic algorithm: Difference between revisions