Proof of `Translations between machine models` (2nd statement)
groundedproofs/Lax119563Proofs/Bridges/ToTM2.lean · lax-119563
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
The stack machine simulates () within steps for , a polynomial in .