User blog comment:LittlePeng9/Random Turing machines/@comment-5529393-20130413053946/@comment-5150073-20130413111854

Yes, and your program is the only example of literally millillions of programs with 101 states, 10 symbols, really hard and non-trivial behaviour. However, your program showed some decent lower bound for specific value of BB(n,m), for which I congratulate you!