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…