User blog comment:LittlePeng9/Random Turing machines/@comment-5150073-20130328215119/@comment-1605058-20130329111219

I can prove this machine halts. It's halting time, however, is at least n(n-1)(n-2)/6, where n is above 900 000 000. This is connected to how machine checks every number divisor-by-divisor, so imagine it checking very large prime number