Reachability

Cslib.lean

@@ -32,6 +32,8 @@ public import Cslib.Computability.Languages.RegularLanguage
 public import Cslib.Computability.Machines.MultiTapeTuring.AddRoutine
 public import Cslib.Computability.Machines.MultiTapeTuring.Basic
 public import Cslib.Computability.Machines.MultiTapeTuring.CopyRoutine
+public import Cslib.Computability.Machines.MultiTapeTuring.DecRoutine
+public import Cslib.Computability.Machines.MultiTapeTuring.DuplicateRoutine
 public import Cslib.Computability.Machines.MultiTapeTuring.EqualRoutine
 public import Cslib.Computability.Machines.MultiTapeTuring.GraphReachability
 public import Cslib.Computability.Machines.MultiTapeTuring.HeadStats

Cslib/Computability/Machines/MultiTapeTuring/AddRoutine.lean

@@ -48,7 +48,7 @@ theorem add₀_eval_list {tapes : Fin 6 → List (List OneTwo)} :
       dya_inv ((tapes 1).headD [])) :: (tapes 2)))) := by
   simp [add₀]
   by_cases h : dya_inv ((tapes 0).head?.getD []) = 0
-  · simp [h]; grind
+  · simp [h]
   · grind
 
 /--

Cslib/Computability/Machines/MultiTapeTuring/EqualRoutine.lean

@@ -48,10 +48,11 @@ public def eq {k : ℕ} (q s t : Fin k)
   MultiTapeTM k (WithSep OneTwo) :=
   eq₀.with_tapes [q, s, t].get h_inj
 
+-- TODO why does the linter complain about simp here?
 @[grind =]
-public theorem eq_eval_list {k : ℕ} {q s t : Fin k}
+public theorem eq_eval_list {k : ℕ} {q s t : Fin k.succ}
   (h_inj : [q, s, t].get.Injective)
-  {tapes : Fin k → List (List OneTwo)} :
+  {tapes : Fin k.succ → List (List OneTwo)} :
   (eq q s t).eval_list tapes =
     Part.some (Function.update tapes t ((if (tapes q).headD [] = (tapes s).headD [] then
       [.one]