Revision as of 14:01, 5 July 2015 edit 86.82.44.193 (talk) →Nondeterministic doesn't mean an algorithm that makes choices ← Previous edit		Revision as of 17:48, 5 July 2015 edit undo 85.151.241.90 (talk) →Nondeterministic doesn't mean an algorithm that makes choices Next edit →
Line 68: * Can we please copy that definition. Nondeterministic algorithms don't really have physical counterparts as in algorithms with choice points which choose a progression. Rather, they are used in studies of conceptual algorithms and formal verification. I.e., they are convenient in providing specifications. A (deterministic) sorting algorithm is equivalent to its nondeterministically specified algorithm which simply chooses the right ordered sequence. Typically, a nondeterministic algorithm doesn't have a direct computational interpretation which seems to be the source of all the confusion here. Providing a definition as if it has a computational interpretation completely misses the point. * The introduction is not 80% correct, it is ~~completely~~100% wrong. This article needs a rewrite. [[Special:Contributions/86.82.44.193\|86.82.44.193]] ([[User talk:86.82.44.193\|talk]]) 14:01, 5 July 2015 (UTC)

Talk:Nondeterministic algorithm: Difference between revisions