fact: Fixpoint update {X} (n : nat) (l : list X) y := match l, n with | nil, _ => nil | x :: l, 0 => y :: l | x :: l, S n => x :: update n l y end.
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)