Recursive Deterministic: Extended Transition Function

After the quick intro to non-deterministic acceptors, Langan defines an extended transition function that allows our acceptor to accept or reject strings of arbitrary length. The implementation can be found here:

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

This allows our acceptor to accept or reject full strings of input. Previously, we were accepting or rejecting individual characters, with the acceptance or rejection of the string based on the acceptance or rejection of the last character after iteration. They’re the same, in this case. The for loop and the recursion should be equivalent, apart perhaps from the order of processing, which could be adjusted to make them equivalent.