Content deleted Content added
Cwmhiraeth (talk | contribs) Closing requested move survey; no consensus. |
Mention issues with introduction |
||
Line 43:
:::I don't know whether I understand your objection, and I have no idea how to address it. Can you please suggest a rewording that would be more to your taste? (And sign your comments by appending four tildes.) Thanks. [[User:Rp|Rp]] 15:52, 21 October 2007 (UTC)
This seems to be an old discussion, but I would like to add that perhaps the many nondeterministic algorithms do in fact give the same output given the same input and are neither inherently parallel nor randomized. These include regular expressions, many parsing algorithms, type inference, etc. I don't know of a good definition, but the current one is wrong and '''misleading'''. I do not think it is helpful for non-experts. It may even be a good idea to avoid any definition at all in the beginning and introduce the subject via examples or by how nondeterminism is implemented using backtracking on physical computers. Mentioning randomization and parallel implementation of nondeterminism leads to confusion if done too early. The page doesn't go into this, but randomization is most often a sound but not complete implementation of nondeterminism (if it proves something, that proof is correct, but it may not find the proof). Parallelism is better but is misleading since it can conflate potential to be incorrect with nondeterminism. [[User:Slaymaker1907|Slaymaker1907]] ([[User talk:Slaymaker1907|talk]]) 09:56, 1 March 2021 (UTC)
== examples ==
| |||