::::Once again: I don't think of the action of a nondeterministic algorithm in any of these three ways, as they make nondeterministic machines very weird creatures. There is a fourth way:
::::# Running on a non-deterministic computer that makes choices at each branching point.
::::However, we then have to consider isreconsider the notion of acceptance., Acceptancewhich 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)
