Documentation

Complexitylib.Metacomplexity.MCSP.AntiChecker.Enumeration.FixedWidth

Fixed-width circuit-candidate enumeration #

Canonical small-circuit codes and valid fixed-width descriptions enumerate exactly the same bounded well-formed raw circuits. Consequently, replacing the variable-length survivor domain preserves its cardinality exactly.

noncomputable def Complexity.AntiChecker.candidateCodeFixedWidthEquiv (arity threshold : ) :
(CandidateCode arity threshold) CircuitCode.FixedWidth.ValidDescription arity threshold

Canonical variable-length candidates are in exact correspondence with valid fixed-width circuit descriptions.

Equations
Instances For
    theorem Complexity.AntiChecker.decode_candidateCodeFixedWidthEquiv {arity threshold : } (code : (CandidateCode arity threshold)) :

    A candidate code decodes to the raw circuit represented by its associated fixed-width description.

    theorem Complexity.AntiChecker.candidateCodeFixedWidthEquiv_symm_val {arity threshold : } (description : CircuitCode.FixedWidth.ValidDescription arity threshold) :
    ((candidateCodeFixedWidthEquiv arity threshold).symm description) = (↑description).toRawCircuit.encode

    Mapping a valid fixed-width description back to the canonical candidate domain returns the raw encoding of its represented circuit.

    The fixed-width valid-description type has exactly as many members as the canonical variable-length candidate-code set.

    The fixed-width description cube fits inside the existing uniform unary code-length bound.