Every bounded-sum expression has a uniform charged RAM program
ProvedStableMSR.Recovery.Compiler.BoundedSum.bounded_sum_compileralgorithmsclusteringderandomization
Structural induction compiles a finite bounded-sum expression. A fixed renaming changes the input-register map. Each resulting program is independent of all numerical input values.
Preamble
import Definitions.Def_StableMSR_BoundedSumRAM open StableMSR.Recovery StableMSR.Recovery.Compiler StableMSR.Recovery.Compiler.BoundedSum open Polynomial
Formal statement
theorem StableMSR.Recovery.Compiler.BoundedSum.bounded_sum_compiler (f : Env→ℕ) (h : Form f) : Engine f := by sorry
Source
Shyam Ravichandran and Lev Reyzin, Exact Sum-of-Radii Clustering under Any Constant Stability, arXiv:2611.03547, Appendix B, Theorem B.2. Charged deterministic RAM implementation.