fact: Definition MMA_mon_computable {k} (R : Vector.t nat k -> nat -> Prop) := exists n : nat, exists P : list (mm_instr (Fin.t (S (k + n)))), Forall (fun instr => if instr is DEC c _ then NonZero c else True) P /\ forall v : Vector.t nat k, (forall m, R v m <-> exists c (v' : Vector.t nat (k + n)), (1, P) // (1, Vector.append (0 ## v) (Vector.const 0 n)) ~~> (c, m ## v')).
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