Recursive Non Deterministic

Langan briefly mentions extending the non-deterministic case to the recursive definition. The example can be found here:

Newcombs-Demon/RecursiveNonDeterministic.js at main · ctmuinayear/Newcombs-Demon

We stick to using both dn and dnp to do this. If we wanted we could compress them into a single function. The actual delta function d as far as the tuple F = (S, d, Q, A, q0) is the final one D: S x Q -> Q. The dn and dnp in the code are just convenient ways to code it, but all are wrapped into the mapping d for F.