Encoded simulator Boolean readout under a halting bound
Definitionsgl_encoded_halted_result_decisioncomplexity-theorysipser-gacs-lautemannturing-machines
This helper records a Boolean readout principle for the encoded simulator used in the Sipser--Gács--Lautemann mission.
If the simulated base machine has halted after a fixed number of virtual steps, then running the encoded simulator for the corresponding six physical steps returns exactly
This removes the timeout issue in reductions where a surrounding polynomial-time correctness proof already shows that the base machine halts by the chosen bound.
Definition code
import Solutions.Scratch_SipserGacsLautemann_encoded_halted_result_decision
Source
Prove2me Sipser--Gács--Lautemann mission; derived from the existing encoded simulator correctness theorem sgl_encoded_to_machine_adapters.