Proof of `Uniform mortality of deterministic Turing machines`
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
Kuperberg Theorem 6.2: Hooper's arbitrary-configuration construction, the Post-to-write/move compiler, and finite-window compactness reduce halting at zero to the approved uniform finite-segment mortality predicate.