= Cycler Turing machine
= Turing machine cycler decider
{c}
{synonym}
Bibliography: https://discuss.bbchallenge.org/t/decider-cyclers/33[]
Example: https://bbchallenge.org/279081[].
These are very simple, they just check for exact state repetitions, which obviously imply that they will run forever.
Unfortunately, cyclers may need to run throun an initial setup phase before reaching the initial cycle point, which is not very elegant.
Also, we have no way of knowing the initial setup length of the actual cycle length, so we just need an arbitrary cutoff value.
And unfortunatly, this can lead to misses, e.g. <Skelet machine #1>, a 5 state machine, has a (translated) cycle that starts at around 50-200M styeps, and takes 8 trillion steps to repeat.
Back to article page