There is no known real world non-deterministic Turing Machine. We could only simulate it using a deterministic Turing Machine (like a common computer).
Using this operator make the code really clear (IMHO) and I suppose it is its purpose.
Furthermore, if one day we discover an hardware able to be a non-deterministic Turing machine is discovered, the code will work.
[1]: I doubt such an hardware exists. But you could look about quantum computer for something close to what is a non-deterministic Turing machine.
Comments
There is no known real world non-deterministic Turing Machine. We could only simulate it using a deterministic Turing Machine (like a common computer).
Using this operator make the code really clear (IMHO) and I suppose it is its purpose.
Furthermore, if one day we discover an hardware able to be a non-deterministic Turing machine is discovered, the code will work.
[1]: I doubt such an hardware exists. But you could look about quantum computer for something close to what is a non-deterministic Turing machine.
Navia Systems is designing nondeterministic hardware.
http://www.naviasystems.com/
Maybe I'm missing something, but their web site appears to discuss probabilistic procedures, which is not nondeterminism in the Turing machine sense.
No you're right. I missed the "preferring those choices that cause the program to converge meaningfully" part. Sorry. Disregard.