But how more difficult? In 1962 the mathematician Tibor Radó invented a new way to explore this question by what he called The busy Beverspel. To play, start choosing a specific number of rules – wants that number N. Your goal is to N-Rule turing machine that runs the longest before it finally stops. This machine is called the busy beaver and the corresponding busy beaver number, BB (N), is the number of steps it takes.
In principle, if you want to find the busy beaver for a given NYou just have to do a few things. First make a list of all possible N-Rue Turing machines. Then use a computer program to simulate each machine. Look for significant signs that machines will never stop – for example, many machines will fall into infinite repeating loops. Throw all these non-refugees away. Finally, note how many steps each other machine has taken before it stopped. The one with the longest duration is your busy beaver.
In practice this becomes difficult. To begin with, the number of possible machines is growing rapidly with every new rule. Analyzing them all separately would be hopeless, so you have to write an adapted computer program to classify and throw away machines. Some machines are easy to classify: they stop quickly or fall into easily identifiable infinite loops. But others run for a long time without displaying a clear pattern. For these machines, the stopping problem deserves its terrifying reputation.
The more rules you add, the more computing power you need. But brutal power is not enough. Some machines run so long before they stop that they simulate step by step is impossible. You need smart mathematical tricks to measure their interest rates.
“Technology improvements certainly help,” said Shawn LigockiA software engineer and a long time busy Beaver Hunter. “But they only help so far.”
End of an era
Busy beaver hunters started to seriously chip away the BB (6) problem in the nineties and 2000s during an impasse in the BB (5) Hunt. Among them were Shawn Ligocki and his father, Terry, an applied mathematician who performed their search program in the off -hours on powerful computers of Lawrence Berkeley National Laboratory. In 2007 they found a turing machine of six rough ones that broke the record for the longest runtime: the number of steps it did before he stopped had nearly 3,000 digits. That is a colossal number according to a normal measure. But it’s not too big to write down. In 12-point font, those 3,000 digits cover almost a single sheet of paper.
Three years later, a Slovak student of Computer Sciences called Pavel Kropitz decided to tackle the BB (6) Hunt as a senior thesis project. He wrote his own search program and prepared to be performed in the background on a network of 30 computers in a university laboratory. After a month he found a machine that ran much longer than the one who discovered the Ligockis – a new ‘champion’, in the Lingo of busy Beversjagers.
“I was lucky because people in the lab were already complaining about my CPU use and I had to scale back a bit,” Kropitz wrote in a direct message exchange on the Busy Beaver Challenge Discord Server. After another month, he broke his own record with a machine whose duration had more than 30,000 digits – enough to fill around 10 pages.
#search #find #longest #running #simple #computer #program