proposition: Lemma sss_terminates_iff {n s P} : sss_terminates (@mma_sss n) P s <-> Sim.terminates (sss_step (@mma_sss n) P) s.
proof: Proof. split. - move=> [t] [/sss_compute_iff ? /out_code_iff ?]. by exists t. - move=> [t] [/sss_compute_iff ? /out_code_iff ?]. by exists t. Qed.
imports: Undecidability(TM.TM) Undecidability.MinskyMachines(MM MMA MMA.mma_defs Util.MMA_computable) Undecidability.Shared.Libs.DLW(Vec.pos Vec.vec Code.sss) List PeanoNat Lia Relations ssreflect