Physical descriptor construction for three times the source value plus two
ProvedIntMul.AffineTriple.affine_descriptoralgorithmsfixed-tape-routinginteger-multiplicationturing-machines
For any finite big-endian source word , the fixed three-tape machine, starting with the actual marked source and empty output and scratch banks, halts in its exact final frame within
actual transitions. It retains the source cells, returns the source head to its marker, leaves scratch empty, and writes a little-endian word whose output cursor is at its actual end and which satisfies
The source may be empty or contain leading zeros. No numerical value or length is supplied to the machine. For the computed block-size-minus-one descriptor, this constructs the coefficient-precision-minus-one value .
Preamble
import Definitions.Def_IntMul_AffineTriple import Mathlib.Tactic open IntMul IntMul.AffineTriple
Formal statement
theorem IntMul.AffineTriple.affine_descriptor (w : List Bool) :
∃ t : ℕ, t≤ 2*w.length+4 ∧ machine.step^[t] (initialFrame w)=finalFrame w ∧
BinaryAdder.littleVal (triple 2 w.reverse)=3*val w+2 ∧
(triple 2 w.reverse).length≤ w.length+2 := by sorrySource
Original physical finite-carry descriptor transformation, full retained frame and explicit clock. Written by Codex.