{c}

Non formal proof with a program March 2023: https://www.sligocki.com/2023/03/13/skelet-1-infinite.html Awesome article that describes the proof procedure.

<Formal proof> August 2023: https://discuss.bbchallenge.org/t/skelet-1-is-a-translated-cycler-coq-agrees/166

The proof uses <Turing machine acceleration> to show that <Skelet machine #1> is a <Translated cycler Turing machine> with humongous cycle paramters:
* start between 50-200 M steps, not calculated precisely on the original post
* period: ~8 billion steps


Skelet machine \#1 is infinite

Skelet machine #1 is infinite

Bibliography: https://discuss.bbchallenge.org/t/decider-translated-cyclers/34

Like a cycler, but the cycle starts at an offset.

To see infinity, we check that if the machine only goes left N squares until reaching the repetition, then repetition must only be N squares long.


Ciro Santilli @cirosantilli 37

 Incoming links: Translated cycler Turing machine