proposition: Theorem BSM_MM_HALTS_ON_ZERO : Halt_BSM ⪯ MM_HALTS_ON_ZERO.
proof: Proof. exists f. red. setoid_rewrite Halt_BSM_iff. intros (n & i & P & v); simpl. destruct (bsm_mm_compiler_2 i P) as (Q & H); simpl; auto. Qed.
imports: Undecidability.Synthetic.Definitions Undecidability.Shared.Libs.DLW(utils list_bool pos vec subcode sss) Undecidability.StackMachines(bsm_defs) Undecidability.MinskyMachines.MM(mm_defs mm_utils mm_comp)