The same algorithm laid out in time
The same algorithm laid out in time

Time: One Gate Pair, Many Steps

17.11.2026 · AE561117

Now the other idea. Do not build five adders. Build one and walk it along the number.

Each step it reads one bit from a tape, computes XOR and AND, writes the result, and moves one cell to the left.

But then the carry from this step must wait for the next one. Something must remember it. That memory is the machine’s state.

no sessions catalogued here yet