closed state/transition cluster: caught in a range of states

This decider does not correspond to a “family”, since it does describe the TMs future operation only by the states, and ignores the tape contents completely.
In mabu90 we have:

If there is a set S of states such that all transitions from elements of S are defined and their target state is also in S, (and the machine is in one of these states) it will never again leave S and thus not halt (closed state/transition cluster).

Currently (2022-07-10) I miss it from the collection of deciders. Since in 1990 it were important (and very efficient), I would think its omission should have an explicit explanation.

Informally: we scan the states s of the TM downwards, fail if one of the transitions of s is not defined, compute the lowest target state occurring in the transitions of s, and succeed, when s <= (that minimum).

Decider tests

NYI

Results

That some of the TMs in question are (Translated) Cyclers, does not come as a surprise to me. That some of them are decided by “Backward reasoning” does come as a surprise.

Now, that I have thought about it, I suspect “Backward reasoning” to catch most of the TMs in question. But I am not sure about this… what do you think about it?

I would guess that backwards reasoning would decide all of the cases a decider for the closed state/transition cluster would, as they operate with similar reasoning (prove getting to the halt state is impossible).

The only way a backwards reasoning test wouldn’t pick it up was if there was a way to “reverse” the Turing machine while still avoiding the closed loop. It seems unlikely to me that this would ever happen for a non-halting machine.

A tiny proof is drafted in the comments of the decider as of why you don’t have to run the machines to conclude:

If the machine ever enters a closed set of states where
all transitions are defined, then it never halts.

Note that by:
1. By construction, any state of a machine of bbchallenge that
contains at least one defined transition has been reach at some point in the
execution of the machine.
2. Furthermore, there are no machines in the db with a state that has 2 undefined transitions,
since this is solved by BB(4) = 107 during enumeration. This means that with point 1. we know
that all the states of the machine are reached at some point by the machine when started from
blank tape.
Hence we don't need to run the machine at all, but we just need to check its code to see if there
exists such a closed set of states where all transitions are defined. We know that it'll be reached
and that the machine does not halt.