Talk:BitChanger Busy beaver

What was used to confirm these? -PkmnQ (talk) 00:33, 20 February 2025 (UTC)

I set up a program to check all bitchanger programs if they surpass a certain time, and print the ones that dont halt. those i confirmed wherther or not they halt myself. C++DSUCKER (talk) 17:32, 20 February 2025 (UTC)

Im working on length 11 programs right now, i have 148 more programs to prove. in total theres 485 programs so i did 337 programs already. C++DSUCKER (talk) 15:41, 22 February 2025 (UTC)

I proved the remaining ones to loop, will be adding the Busy beaver for 11 C++DSUCKER (talk) 17:32, 22 February 2025 (UTC)

Shouldn't }}<[<] take 10 steps? Namely, }, }, <, [, <, ], [, <, ], [. You seem to count each ], [ pair as a single step but the description here says that ] jumps back to the corresponding [ unconditionally. (Alternatively, it would be helpful to clarify how loop iterations are counted on this Busy Beaver pager.) --Int-e (talk) 21:35, 22 February 2025 (UTC)

I went with the second option, i explained how i count them. if you are unhappy with the way we count instructions, all we need to do is recalculate the new best one, i wont have to prove the rest is unhalting. C++DSUCKER (talk) 15:50, 23 February 2025 (UTC)

I replicated your results and went ahead with adding numbers and programs for both conventions. --Int-e (talk) 23:29, 26 February 2025 (UTC)

Oh, thanks a lot! i was working on eliminating about 1000 programs by hand but what you did is even more impressive!

Im working on BB(15) right now, i already proved 32 out of 54 to loop. C++DSUCKER (talk) 13:31, 3 March 2025 (UTC)