Content deleted Content added
→Requested move 22 October 2019: doesn't seem like that interpretation has support in RS |
Cwmhiraeth (talk | contribs) Closing requested move survey; no consensus. |
||
Line 107:
== Requested move 22 October 2019 ==
<div class="boilerplate" style="background-color: #efe; margin: 0; padding: 0 10px 0 10px; border: 1px dotted #aaa;"><!-- Template:RM top -->
:''The following is a closed discussion of a [[Wikipedia:Requested moves|requested move]]. <span style="color:red">'''Please do not modify it.'''</span> Subsequent comments should be made in a new section on the talk page. Editors desiring to contest the closing decision should consider a [[Wikipedia:move review|move review]] after discussing it on the closer's talk page. No further edits should be made to this discussion. ''
The result of the move request was: '''No consensus.''' <small>([[Wikipedia:Requested moves/Closing instructions#Non-admin closure|non-admin closure]])</small> [[User:Cwmhiraeth|Cwmhiraeth]] ([[User talk:Cwmhiraeth|talk]]) 14:21, 15 November 2019 (UTC)
----
[[:Nondeterministic algorithm]] → {{no redirect|Nondeterministic computation}} – The present title is clearly ambiguous as shown in the preceding thread of this talk page, and the disambiguation hatnote that I have added to the article. The proposed title is much clearer as referring to effective computation (the subject of the article rather than to abstract algorithms. [[User:D.Lazard|D.Lazard]] ([[User talk:D.Lazard|talk]]) 17:36, 22 October 2019 (UTC) <small>--'''''Relisting.''''' [[User:Steel1943|<span style="color: #2F4F4F;">'''''Steel1943'''''</span>]] ([[User talk:Steel1943|talk]]) 03:35, 31 October 2019 (UTC)</small> <small>—'''''Relisting.''''' [[User:Wugapodes|Wug·]][[User talk:Wugapodes|a·po·des]] 04:53, 8 November 2019 (UTC)</small>
Line 129 ⟶ 134:
::::However, we then have to reconsider the notion of acceptance, which no longer means: whatever the outcome of the algorithm's run, that's the result. Instead, we accept nondeterministically, that is to say: we accept a string if ''some'' run of the machine accepts it. This interpretation makes physical sense, it directly corresponds to search problems in real life, and it is natural to people who have seen modal or temporal logic (see [[Possible world]]). [[User:Rp|Rp]] ([[User talk:Rp|talk]]) 08:50, 8 November 2019 (UTC)
:::::To be clear, when you say it "makes choices", you mean that it makes choices ''stochastically''? If so, that sounds like a very different beast from the other conceptualizations. In particular, it has the property that, if we're doing a finite number of runs, there is a non-zero chance that the algorithm returns the wrong answer (i.e. rejects when it should have accepted). I don't think this agrees with what RS say about randomized algorithms e.g. [https://xlinux.nist.gov/dads/HTML/nondetermAlgo.html], [https://cs.nyu.edu/courses/spring03/G22.2560-001/nondet.html]. [[User:Colin M|Colin M]] ([[User talk:Colin M|talk]]) 20:01, 10 November 2019 (UTC)
----
:''The above discussion is preserved as an archive of a [[Wikipedia:Requested moves|requested move]]. <b style="color:red">Please do not modify it.</b> Subsequent comments should be made in a new section on this [[Help:Using talk pages|talk page]] or in a [[Wikipedia:Move review|move review]]. No further edits should be made to this section.''<!-- Template:RM bottom --></div>
| |||