Once upon a time, over 40 years ago, a horde of computer scientists descended on the West German city of Dortmund. They were competing to catch an elusive quarry — only four of its kind had ever been ...
"Hearst Magazines and Yahoo may earn commission or revenue on some items through these links." Here’s what you’ll learn when you read this story: First, a brief explanation. The aforementioned BB(1), ...
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 ...
In 2025, the edges of mathematics came a little more sharply into view when members of the online Busy Beaver Challenge community closed in on a huge number that threatens to defy the logical ...
Programmers normally want to minimize the time their code takes to execute. But in 1962, the Hungarian mathematician Tibor Radó posed the opposite problem. He asked: How long can a simple computer ...
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 ...
Add Yahoo as a preferred source to see more of our stories on Google. Here’s what you’ll learn when you read this story: The Busy Beaver number, or BB(n), represents a mathematical problem that tries ...
Add Yahoo as a preferred source to see more of our stories on Google. Here’s what you’ll learn when you read this story: The Busy Beaver number, or BB(n), represents a mathematical problem that tries ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results