Latest Tech News

Stay updated with the latest in technology, AI, cybersecurity, and more

Filtered by: busy Clear Filter

The Quest to Find the Longest-Running Simple Computer Program

The original version of this story appeared in Quanta Magazine. Imagine that someone gives you a list of five numbers: 1, 6, 21, 107 and—wait for it—47,176,870. Can you guess what comes next? If you’re stumped, you’re not alone. These are the first five busy beaver numbers. They form a sequence that’s intimately tied to one of the most notoriously difficult questions in theoretical computer science. Determining the values of busy beaver numbers is a daunting challenge that has attracted a cult

Busy beaver hunters reach numbers that overwhelm ordinary math

But just how much harder? In 1962, the mathematician Tibor Radó invented a new way to explore this question through what he called the busy beaver game. To play, start by choosing a specific number of rules — call that number n. Your goal is to find the n-rule Turing machine that runs the longest before eventually halting. This machine is called the busy beaver, and the corresponding busy beaver number, BB(n), is the number of steps that it takes. In principle, if you want to find the busy beav