Proof of `Generic-time simulation of word RAMs by Turing machines`
groundedproofs/Lax759944Proofs/GenericTimeSimulation.lean · lax-759944
What this proof establishes
no assumptions
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
Description
Snapshot the exact length-prefixed input during the measured run, eliminate the extended input instructions with the verified buffer compiler, then run the existing Turing simulation at polynomially bounded word width.