Content deleted Content added
Line 59:
:::::::I think you have a point - the term isn't commonly used in such a wide sense. But I can't see how to make a good definition that would exclude such examples. [[User:Rp|Rp]] ([[User talk:Rp|talk]]) 07:58, 8 June 2010 (UTC)
== Nondeterministic doesn't mean an algorithm that makes choices ==
There are many algorithms that may make an arbitrary choice at some point that are not considered nondeterministic by any source I'm aware of. In nearly any search, there is a choice of which node to visit next, but that does not make the search nondeterministic. In quicksort, any element may be chosen as the partition, but that does not make quicksort nondeterministic. According to [[CLRS]], a multithreaded algorithm is nondeterministic if its behavior might vary from run to run. That is, the algorithm makes a choice, and '''on different runs that choice may differ'''. In other words, the exact behavior of the algorithm cannot be ''determined'' ahead of time. I will rework this article entirely unless someone can come up with a source that contains a different definition. -- [[User:Schapel|Schapel]] ([[User talk:Schapel|talk]]) 17:08, 16 August 2011 (UTC)
| |||