proposition: Theorem MM2_ndMM2_equiv a b : MM2_HALTS_ON_ZERO (P,a,b) <-> Σ // a ⊕ b ⊦ 1.
proof: Proof. split. + intros H; apply mm2_prog_enc_compute in H; auto. + apply mm2_prog_enc_complete. Qed.
imports: List Arith Lia Relations Undecidability.MinskyMachines(MM2 ndMM2) Undecidability.Shared.Libs.DLW(utils) Undecidability.Synthetic(Definitions ReducibilityFacts)