But how tough it is? In 1962, the mathematician Tibor Radó invented a novel way to examine this question through what he called Busy game Beaver. To play, start by choosing a specific number of rules – return this number N. Your goal is to find N-Nule Turing machine that works for the longest time before it finally stops. This machine is called a crowded beaver and a suitable bobra, BB number (N) is the number of steps he takes.
Basically, if you want to find a busy beaver for any given NYou just have to do a few things. First, replace all possible N-Nule Turing Machines. Then employ a computer program to simulate starting any computer. Look for signs that the machines will never stop – for example, many machines will fall into the infinite repetitive loops. Reject all these machines without halting. Finally, record how many steps each other machine took before stopping. The one with the longest executive environment is your busy beaver.
In practice, it becomes tough. At the beginning, the number of possible machines is growing rapidly with every novel rule. Analysis of them all would be hopeless, so you need to write a non -standard computer program for classifying and rejecting machines. Some machines are straightforward to classify: either stop quickly, or fall into identifying infinite loops. But others work for a long time without displaying any obvious pattern. In the case of these machines, the problem of detention deserves its terrifying reputation.
The more rules you add, the more computing power you need. But brutal strength is not enough. Some machines work as long as stopping that their simulation is impossible step by step. You need clever mathematical tricks to measure their executive times.
“Technology improvements definitely help,” he said Shawn LigockiSoftware engineer and long -term busy Hunter Beaver. “But they have been helping so far.”
End of the era
The busy Beaver hunters began to fall on the BB (6) problem seriously in the 90s and 2000. During the deadlock in hunting on BB (5). Among them were Shawn Ligocki and his father, Terry, applied mathematician, who hosted the search program in free hours on powerful computers in Lawrence Berkeley National Laboratory. In 2007, they found a six -member Turing machine that broke the record in the longest executive environment: the number of steps that took almost 3,000 digits before stopping. This is a colossal number according to any ordinary measure. But it’s not too large to save. In a 12-point font, these 3000 digits will almost cover a single sheet of paper.
Three years later, the Slovak computer science student Pavel Kropitz decided to solve the hunt for BB (6) as a diploma work project. He wrote his own search program and set it up to operate in the background in the network of 30 computers in the university laboratory. After a month, he found a machine that lasted much longer than that discovered by Ligockis – a novel “master” in the language of moving beavers.
“I was lucky because people in the laboratory already complained about my use of the processor and I had to establish a bit,” Kropitz wrote in a direct exchange of messages about Busy Beaver Challenge Server. After the next month of search, he broke his own record with a machine, whose executive time had over 30,000 digits – to fill about 10 pages.