Proof of `Two polynomial-time conventions, and their separation` (2nd statement)
groundedproofs/Lax560851Proofs/RamExponentialExample.lean · lax-560851
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
Seven executed RAM instructions, including the final halt, suffice. A sufficient word length is binary input size plus four, which fits the arena, the literal six, and the output.