4 ms·

Just express it as an n-state Turing machine and see if it halts within BB(n) steps. /s

• AnimalMuppet 3y ago
  And, if n is large enough, then I can retire today.