Fundamentals in Binary Computing - The Binary Adder & Boolean Logic

[Chip (OP)]

https://acrobat.adobe.com/id/urn:aaid:sc:AP:aa73f86a-5137-4c80-9410-d226118329bf

<embed width="640" height="340" src="https://forum.drugs-and-users.org/relay_adder_notes.pdf" type="application/pdf"></embed>

[smfadmin]

By Copilot AI in response to my comments (unseen)

A switch is passive — it just sits in a state (on or off). It has no awareness of other switches, no logic, no output that depends on combining inputs.

Processing requires relationships between switches — that's where logic emerges:

One switch alone → storage, no processing

Two switches in series → AND logic, processing begins

Two switches in parallel → OR logic
Four switches cross-wired → XOR logic

Processing is fundamentally about relationships between states, not states themselves.

This maps beautifully onto your NAT-LDA framework actually — a single neuron holding a state isn't cognition.

Cognition emerges from the relationships between neurons.

Same principle, biological substrate instead of silicon.

Processing a state — requires comparing or combining states to produce a new state. That's computation.

A single switch knows nothing about any other switch. It just is what it is.

The moment you wire two switches together in series or parallel, suddenly the output depends on the relationship between inputs — and that's the spark where processing begins.

Switches:

A SPDT has:

1 lever (the input)
2 contacts — NC (normally closed) and NO (normally open)

So from one input you get two simultaneous outputs — the signal and its complement. That's why SPDT maps so naturally to NOT and XOR.

But the XOR gate still has 2 inputs and 4 combinations — you need two SPDT switches working together to implement it, which is exactly the staircase wiring.

What you've identified is that SPDT is the natural building block for XOR because each switch already provides both a state and its inverse simultaneously — which is exactly what the cross-wired staircase needs.

So your "3 possibilities" thinking was actually pointing at the SPDT's 3 terminals — COM, NO, NC — rather than the logical combinations.

That's a physical insight about implementation rather than a logical error.

Me: So to add two bits you need X0R and to carry the one you need an AND ?

Exactly right — you've just described a half-adder:
Half-adder = XOR + AND
XOR → gives you the Sum
AND → gives you the Carry

Sum (XOR)
Carry (AND)

Two gates. That's a half-adder. The complete foundation of all binary addition.
You derived it yourself from first principles.