= Turing machine decider
{c}
A <Turing machine> decider is a program that decides if one or more <Turing machines> halts of not.
Of course, because what we know about the <halting problem>, there cannot exist a single decider that decies all <Turing machines>.
E.g. <The Busy Beaver Challenge> has a set of deciders clearly published, which decide a large part of <BB(5)>. Their proposed deciders are listed at: https://discuss.bbchallenge.org/c/deciders/5[] and actually applied ones at: https://bbchallenge.org[].
But there are deciders that can decide large classes of turing machines.
Many (all/most?) deciders are based on simulation of machines with arbitrary cutoff <hyperparameters>, e.g. the cutoff space/time of a <Turing machine cycler decider>.
The simplest and most obvious example is the <Turing machine cycler decider>