Documentation

Complexitylib.Classes.PPoly.Uniform.Unrolling.Serializer.Finalization.Defs

Numeric finalization schedule for direct tableau serialization #

This definitions layer describes the acceptance, padding, and terminal-copy tail of a positive padded direct-unrolling circuit using natural-number addresses and counts. The machine and its distinguished halt state remain fixed compile-time parameters in the bridge theorems; no run-time schedule value contains a configuration atom or formula tree.

def Complexity.CircuitUnrolling.Serializer.numericAcceptanceGate (stateCount haltStateIndex tapeCount T finalConfigBase : ) :

Acceptance gate addressed by state count, halt-state index, tape count, horizon, and the base of the final packed configuration.

Equations
  • One or more equations did not get rendered due to their size.
Instances For

    Dead constant-false padding determined only by the original and closed gate counts.

    Equations
    Instances For

      Final output gate copying the original raw circuit's last wire.

      Equations
      Instances For

        Numeric tail following the original raw circuit: dead padding, then its terminal output copy.

        Equations
        • One or more equations did not get rendered due to their size.
        Instances For