UPDATE
apologies, my assumption was wrong. This algorithm will work, i.e. produce correct output, if the base is of the form 2*n.
In reply to Re^2: A mod2 Machine.
by code-ninja
in thread A mod2 Machine.
by code-ninja
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |