fact: Definition prep (p : pos k) (i : nat) : list (mm_instr (pos (1 + k + n + 3))) := mm_transfert (reg p) pos0 (tmp pos0) i ++ [INC (reg p)] ++ [DEC Fin.F1 (14 + i)] ++ mm_push_One (reg p) (tmp pos0) (tmp pos1) (5+i) ++ [DEC (tmp pos0) (4 + i) ].
imports: Undecidability.MinskyMachines(MM_computable MM_sss mm_utils) Undecidability.StackMachines(BSM_computable) Undecidability.Shared.Libs.DLW(vec pos sss subcode) Lia Vector Nat Arith List Undecidability.MinskyMachines.MM(mm_defs mm_utils mm_comp_strong)