by Jonathan Kujawa

Nearly two years ago we talked at 3QD about the Busy Beaver problem [1]. Since then, the beavers have been busy.
As discussed in that essay, the Busy Beaver problem measures how complicated a computation might be. It does so by measuring how long a Turing might run before stopping.
A Turing machine is a theoretical model for a computer. It has a set of states that tell the machine what to do next. The states are the “software” of the Turing machine.
In a real computer, the more complicated your software, the more you can do. The same goes for a Turing machine. The more states, the more the machine can do. If you allow me to use a Turing machine with 744 states, I can build a machine that can determine the validity of the Riemann hypothesis. Since resolving the Riemann hypothesis is arguably the most famous problem in mathematics and worth a cool $1,000,000, there must be some reason nobody has tried this approach. Indeed, there is a small problem. A Turing machine with 744 states can run a long time.
That brings us to the Busy Beaver. The Busy Beaver of 744 is the number of steps a Turing machine with 744 states might run before it finally stops. For example, it is known that — at worst — a Turing machine with two states might take six steps before halting. For short, we’ll write this as BB(2)=6. Somewhat worse, BB(4)=107, but that’s still not too bad. Never mind BB(744), how big could BB(5) be? Pretty darn big, it turns out!
After 40 years, there was a breakthrough in computing Busy Beavers. On July 2nd the Busy Beaver Challenge (BBC) announced that they had computed BB(5). We now know how long a five-state Turing machine might run before halting:
BB(5)=47,176,870.
In 1990, Heiner Marxen and Jürgen Buntrock found a five-state Turing machine that took that many steps. The problem, though, is that there might be a five-state Turing machine that takes even longer. There are millions and millions and millions of five-state Turing machines. It is a massive task to test them all. Worse, many of those Turing machines will never halt. To compute BB(5), you must correctly identify the ones that halt and correctly compute the number of steps they take before they halt. Read more »


.


Some things in life are very hard to give up. For me, I hope in a most singular manner, it is bullshit. I have spent nearly twenty years reading whatever literature I can find on what bullshit might be. Since the publication of Professor Harry Frankfurt’s
In the late 1960’s and early 70’s, my maternal grandmother spent a lot of time in the United States. She would return to Iran, her suitcase filled with presents like candy and fruity bubble gum for her grandchildren, and pretty shirts and dresses for our mom. She also brought back a part of her daily American life: cartons of red Winston cigarettes, Crest toothpaste, hand and face creams with English writings on the bottles, and Dial Soap in that beautiful saffron gold color that was unlike any soap I had seen or smelled before. Our soaps in Iran were usually either flower scented and over perfumed, or green and organic because of the local olive oil used to make them. Everyone valued the green soaps, but I just wanted the American gold soap. I would watch her put the soap back in a plastic container after her shower to keep it from drying and when she was away from her room, I would go open the plastic container and smell the
With apologies to Charles Dickens, it will be the best of times, it will be the worst of times.



Sughra Raza. Self Portrait in Early Summer, May 2024.