Papers · Preprint · v3

To XOR a Stone with Six Birds: Closure Diagnostics for Emergent Bits, Gates, and Booleanity

When does a system earn a logic?

In plain words

Boolean logic is usually the starting point. Here it has to be earned. A logic layer is an audited closure of packaged predicates under the system's own dynamics.

Bits are packaged classes. Gates are the updates induced on them. Diagnostics measure metastability, closure defect, gate error and lost input information.

In a laboratory with leaky parity sectors, parity is an exactly closed bit: its route mismatch is zero at every leakage rate and horizon, while every other balanced split and the AND predicate stay strictly positive. Reading a reversible XOR (CNOT) through its output bit alone, instead of its full register, raises the input information left unaccounted for from about 0.141 bits to 1.141 bits, a factor above eight. A small unsupervised pipeline recovers the intended stable bits from transition data and reconstructs a NOT gate.

Left: register values 00 and 11 form the even sector and 01 and 10 the odd sector; each sector stays put with probability 1 − p and switches with probability p, and both values in a sector share the same next-step probabilities. Right: route mismatch at p = 0.05 after one step, as bars: parity 0, closed; second bit 0.005; first bit 0.025; AND 0.293. Route mismatch compares futures within a group; 0 means the grouping closes.
The paper's parity laboratory. A two-bit register leaks between its even and odd sectors, but every state's next step depends only on its sector. So grouping states by parity puts together states with identical futures, and the grouping closes exactly, at every leak rate. Any other grouping, reading one bit or AND, mixes the sectors and leaves a mismatch.

What it shows

  • A falsifiable criterion for having logic at a layer.
  • Gates fail differently: NOT and AND lose closure when their stored inputs drift, while a noiseless one-step CNOT is a perfect channel even though its output bit, read alone, is maximally unclosed.
  • Bit and gate discovery from dynamics, with the predicate and quotient facts formalized in Lean 4.

What it does not claim

Logic is not treated as fundamental.

Cite

Tsiokos, I. (2026). To XOR a Stone with Six Birds: Closure Diagnostics for Emergent Bits, Gates, and Booleanity. Zenodo. https://doi.org/10.5281/zenodo.23118421