Content deleted Content added
No edit summary |
→Misleading Article: suggestions Tag: Disambiguation links added |
||
Line 146:
:::It's exactly the opposite: a nondeterministic algorithm leaves choices open, it ''refrains'' from making them. Or in the context of nondeterministic acceptance, you could say: it makes ''all'' of them. What it doesn't do is make choices, i.e. choose between multiple options by picking one and not picking the rest. [[User:Rp|Rp]] ([[User talk:Rp|talk]]) 21:43, 1 June 2021 (UTC)
::::I wouldn't say "exactly" the opposite, but you're right. I didn't word that carefully enough. My point was that however it is defined, it is important to also explain what you mean by "choice".[[User:02Tails|02Tails]] ([[User talk:02Tails|talk]]) 23:52, 26 July 2021 (UTC)
*The biggest problem is that the hatnote promises that the article is about meaning B (as defined in [[#Requested move 22 October 2019]]), but that is only true of the lead, and the rest of the article is about meaning A. I am adding a "Confusing" template to warn readers of the article.
*One solution would be to split this article. The two articles would need different names. I suspect that "nondeterministic algorithm" is more appropriate for meaning A. Partly because Floyd (1967) uses it with meaning A, but also because "nondeterminism" with meaning B is only desirable in special cases with more specific names such as [[randomized algorithm]].
*An alternative solution is to merge the material into other articles. There are a lot of possibilities. Those for meaning A include [[nondeterministic programming]] and [[nondeterministic finite automaton]]. Those for meaning B include [[deterministic algorithm]], [[concurrent computing]] and [[concurrency control]]. For disambiguation there is [[indeterminacy in computation]]. [[User:JonH|JonH]] ([[User talk:JonH|talk]]) 16:11, 30 January 2022 (UTC)
| |||