λEnter Calculus CompanionRegistered manuscripts, kept distinct

Manuscript Oai272-A@1 · Oai272-A.tex · section · a40828a0

What ``explicit'' does and does not provide

Stage 3: finite witness construction under an exact support promise › What ``explicit'' does and does not provide · lines 1637–1657

Back to manuscript

An algorithmic or execution theorem must specify:

  1. the input matrices or generating formulas and their exact arithmetic representation;

  2. every needed positivity, rank, support, or geometric promise;

  3. output format, bit precision, and normalization;

  4. computational cost and termination conditions;

  5. whether the task is generating a matrix, verifying a certificate, measuring a witness, or classifying an arbitrary input.

A finite formula can specify a large object without any program in the release having instantiated it.

Family 283's target-dependent oracle, Family 281's energy approximation, En02-B's decoder, and Landmark I's readout do not supply those missing objects. The representability/production split in Oai265-A is an appropriate comparison, not an algorithmic premise CheungOai265A,ComparisonDossier.