Physical retained-descriptor copy with both heads rewound and an exact linear clock
ProvedIntMul.DescriptorCopy.copy_descriptoralgorithmsfixed-tape-routinginteger-multiplicationturing-machines
For every finite binary word , a fixed three-tape finite routine starts with on source tape 1 and an empty destination tape 2, both heads at their actual markers. Original input cells and head are arbitrary and retained. In exactly
actual transitions it reaches its globally halted final frame with exact copies of on tapes 1 and 2 and both heads at cell zero. Every bit is written and both heads are rewound physically; no payload or cursor jump is supplied at a phase boundary. Empty words and leading zeros are allowed. This routine supports placement of retained parameter descriptors into arithmetic work banks.
Preamble
import Definitions.Def_IntMul_DescriptorCopy import Mathlib.Data.List.GetD import Mathlib.Data.List.TakeDrop import Mathlib.Tactic open IntMul IntMul.DescriptorCopy
Formal statement
theorem IntMul.DescriptorCopy.copy_descriptor (base : machine.Cfg) (w : List Bool) :
machine.step^[2*w.length+3] (initialFrame base w)=finalFrame base w ∧
(machine.step^[2*w.length+3] (initialFrame base w)).state=machine.qHalt ∧
(machine.step^[2*w.length+3] (initialFrame base w)).cells machine.inTape=base.cells machine.inTape ∧
(machine.step^[2*w.length+3] (initialFrame base w)).head machine.inTape=base.head machine.inTape ∧
(machine.step^[2*w.length+3] (initialFrame base w)).cells 1=machine.tapeOf (w.map machine.bitSym) ∧
(machine.step^[2*w.length+3] (initialFrame base w)).cells 2=machine.tapeOf (w.map machine.bitSym) ∧
(machine.step^[2*w.length+3] (initialFrame base w)).head 1=0 ∧
(machine.step^[2*w.length+3] (initialFrame base w)).head 2=0 := by sorrySource
Original physical binary descriptor copying and marker return with complete frame proof. Written by Codex.