Non-deterministic execution of Python functions

&gt; Magical computer that guess for you some data of course doesn&#x27;t exists.<p>Prolog does sunshine like this, no? You give it rules and then make a statement with a blank in it and it&#x27;ll fill in the blank given the rules you&#x27;ve described.

The idea seems so similar to the classical AMB ambiguous operator introduced by John McCarthy [0]. The implementation seems similar to what I&#x27;ve done a while ago, too, just in Lisp and using Lisp primitives rather than function decorators.<p>[0] <a href="http:&#x2F;&#x2F;www.randomhacks.net&#x2F;2005&#x2F;10&#x2F;11&#x2F;amb-operator&#x2F;" rel="nofollow">http:&#x2F;&#x2F;www.randomhacks.net&#x2F;2005&#x2F;10&#x2F;11&#x2F;amb-operator&#x2F;</a><p>[1] <a href="https:&#x2F;&#x2F;github.com&#x2F;phoe&#x2F;amb&#x2F;">https:&#x2F;&#x2F;github.com&#x2F;phoe&#x2F;amb&#x2F;</a>

Makes me think about how non-deterministic computing is basically how you view lists as a context (as opposed to a container) when thinking in terms of Monads in Haskell. Application functors basically form a minimal framework for applying functions to values in a non-deterministic context when working with lists.<p>Making this further relevant is that perhaps the most well known example of monadic programming of lists is: Python&#x27;s list comprehensions. Which makes a bit surprised to see that not more explored&#x2F;exploited in this library.<p>Interesting nonetheless!

Note of clarification.<p>This authors use of &#x27;non-determinsistic&#x27; doesn&#x27;t match the meaning of a Nondeterministic Turing machine used to define the complexity class NP.<p>There are many types of non-deterministic Turing machines, like a probabilistic Turing machine which flips a coin at each step.<p>But the &#x27;maximally lucky guesser&#x27; or &#x27;run all possibilities in one step&#x27; version of NTM&#x27;s that defines NP is physically unrealizable.

Useful to explain non-determinism to students. I saw a similar idea before at <a href="https:&#x2F;&#x2F;github.com&#x2F;aeporreca&#x2F;nondeterminism">https:&#x2F;&#x2F;github.com&#x2F;aeporreca&#x2F;nondeterminism</a> which uses fork() to (inefficiently) explore all possible guesses concurrently