Anti-checker counter relation -- definitions #
The approximate counter estimates the number of canonical small-circuit codes consistent with an arbitrary fixed-width vector of labeled samples. Defining this relation independently of a target function also gives contradictory labels their intended zero-survivor semantics.
One encoded circuit agrees with one explicitly labeled sample. Malformed or non-evaluating codes do not agree.
Equations
- Complexity.GapMCSP.Magnification.AntiCheckerLemma.CodeMatchesLabeledSample code sample = (Complexity.CircuitCode.evalCode arity code sample.input.toList = some sample.output)
Instances For
One encoded circuit agrees with every sample in a fixed-width vector.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Canonical small-circuit codes surviving an arbitrary labeled-sample vector.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Number of canonical small-circuit codes surviving an arbitrary labeled-sample vector.
Equations
- One or more equations did not get rendered due to their size.
Instances For
One valid fixed-width description agrees with one explicitly labeled sample through its parser-free raw-circuit view.
Equations
- Complexity.GapMCSP.Magnification.AntiCheckerLemma.DescriptionMatchesLabeledSample description sample = ((↑description).toRawCircuit.eval? sample.input.toList = some sample.output)
Instances For
Equations
One valid fixed-width description agrees with every sample in a vector.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
Valid fixed-width descriptions surviving an arbitrary labeled-sample vector.
Equations
- One or more equations did not get rendered due to their size.