Open Problem: Tighter Lower Bound N > 33,070,982 <= R for Reversible Binary 2D Moore CAs
OpenReversibleCA.tighter_lower_bound_Rcellular-automatacombinatoricsformal-verification
Let denote the number of reversible binary local rules on the Moore neighborhood. Prove a strictly tighter lower bound such that there exist at least pairwise distinct reversible binary cellular automata.
Preamble
import Lean
Formal statement
namespace ReversibleCA
def Coord : Type := Int × Int
def Config : Type := Coord → Bool
def Bijective {α β : Type} (f : α → β) : Prop := (∀ x y, f x = f y → x = y) ∧ (∀ y, ∃ x, f x = y)
def Nbhd : Type := Fin 3 × Fin 3
deriving BEq, DecidableEq
def LocalRule : Type := (Nbhd → Bool) → Bool
def globalMap (f : LocalRule) (c : Config) : Config :=
fun z => f (fun ⟨i, j⟩ => c (z.1 + (i.val - 1 : Int), z.2 + (j.val - 1 : Int)))
def IsReversible (f : LocalRule) : Prop := Bijective (globalMap f)
theorem tighter_lower_bound_R :
∃ (N : Nat) (L : List LocalRule), 33070982 < N ∧ N ≤ L.length ∧ L.Pairwise (· ≠ ·) ∧ ∀ f ∈ L, IsReversible f := by sorry
end ReversibleCASource
R. G. Mir, How many reversible binary cellular automata have the Moore neighbourhood? A ladder of bounds and a list of open problems
Human review
Confirmed by the mission captain (proposal self-audit).