> I managed to solve all BF programs up to length 12. With 8 possible instructions, that is equivalent to all programs up to 12 * log 8 = 36 bits. Curiously, t

> I managed to solve all BF programs up to length 12. With 8 possible instructions, that is equivalent to all programs up to 12 * log 8 = 36 bits. Curiously, that exactly matches how far we were able to analyze the behaviour of a functional busy beaver [1]. > it stopped after 9212 steps. The largest output of a 36 bit lambda term is a whopping 578960446186580977117854925043439539266349923328202820197287920039565648199686 bits long though... [1] https://oeis.org/A333479 https://oeis.org/A333479