Proof of `Translations between machine models` (1st statement)
groundedproofs/Lax119563Proofs/Bridges/SingleTape.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 simulating machine performs one transition per transition and one more for halting, so it decides within steps ().