Busy Beaver Discuss

Ug, the spammers joined the group! I have added more restrictions including users having to request

I give here more analysis of this (3,3) machine. If A(a,b,c) = ...0(12)^a (11)^b < A (11)^c 0...,

I have often heard about Milton Green's 1964 TMs, but found it hard to understand their behavior

Pascal, you inspired me to dig a little more into this TM! I also found it hard to characterize the

I am delighted to report that my simulator is now able to verify Shawn's 10^^70 TM. The other big

My webpages about busy beavers are no longer at https://webusers.imj-prg.fr/~pascal.michel/index.html

I give here more analyses on the Turing machine p3 found by Pavel Kropitz on May 19, 2023, with s(p3)

Pavel Kropitz found a 3-state, 4-symbol TM which scores > 10↑↑2048! He originally shared it on the

Thanks Heiner, this is very interesting. I especially like how they have made a standard way to

Also, we may only be finding Collatz-like behavior in the BB candidates because it is one of the more

Long ago when I started looking for Busy Beavers, my Dad and I tried using Simulated Annealing: https

You're right, there's some kind of type error in what I'm trying to say. On the other

It seems that my website is no more available at its old address www.logique.jussieu.fr/~michel/ and

I think it's entirely possible already that G < BB(6). G is a huge number of course, but it

I give here more analysis about the machine M that Shawn ligocki found on May 27, 2022, with sigma(M)

The web page seems to crash when I use the Opera browser. On Wednesday, 22 June 2022 at 05:37:38 UTC+

Contributor @lijil has proposed a decider for Unilateral Bouncers: https://discuss.bbchallenge.org/t/

> This is what I mean by a "contracting tape" simulator. I understand now thank you!

I listed the website on the newly created https://bbchallenge.org/story#related-links section. Don

> I think these are both reasonable points of view. They are. I interpreted his post as making a

Dear all, I wanted to share with you a result that Damien and I worked on recently, available at

> Yes, the RPI page and work was very much like what you've started! The problem is these

Hello, You might be interested in our attempt to create such a database and community with https://

Pavel Kropitz gave in his mail on May 22, 2022, a new (6,2) - busy beaver champion M, 1RB 1RH 0LC 0LD

Thanks for the correction, Shawn! Even if we say that the steps function is more important or

I give here more analysis on Pavel's machine M 1RB 1RH 1RC 1RA 1RD 0RB 1LE 0RC 0LF 0LD 0LB 1LA

Thanks for this additional analysis, Pascal! It's great to get these sort of rigorous bounds to

Nice find, Nick. The only other "sibling" (differing only in the E0 transition) I have of

In a mail on March 16, 2022, Nick gave the following machine M with BBB(M) > 7.4 x 10^4079: 1RB

How "lucky" was this machine? It seems sort of like it's performing a random walk (