Halting at padded polynomial time from DPT correctness
Definitionsgl_halts_at_padded_timecomplexity-theorysipser-gacs-lautemannturing-machines
This helper records the halting consequence of a deterministic polynomial-time correctness package.
If a machine decides a predicate at an exact clock and a later clock is at least that exact clock, then at the later clock the machine is in either an accepting or rejecting result state. In particular, if a polynomial upper bound dominates the original clock, then the machine has halted by that padded bound on every input.
This lemma is intended to supply the halting hypothesis needed by clock-free simulator reductions in the Sipser--Gács--Lautemann mission.
Definition code
import Solutions.Scratch_SipserGacsLautemann_halts_at_padded_time
Source
Prove2me Sipser--Gács--Lautemann mission; direct consequence of sgl_machine_time_padding.