Kastalia Knowledge Management System · Glasperlenspiel template · knot 4391

Time: One Gate Pair, Many Steps

🌐 public · created AE561117 (17.11.2026) · by daniel-hromada · open in the standard editor view · 📽 open as presentation

baumhaus.digital/Studium Generale/Short History of the Learning Machine/Logic, Gates, Machine/Time: One Gate Pair, Many Steps

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.

Ancestors (1 superordinated path)