Are computers ready to solve this problem?

In other words, the computer and Collatz concept are the same. For one, like Jeremy Avigad, a scholar and professor of philosophy at Carnegie Mellon, the concept of temporary evolution is the basis of computer science – and Collatz’s practice is an example of temporary evolution, a gradual adherence to the rule of law. Similarly, showing that the process ends with many computer problems. Avigad says: “Computer scientists often want to know that their algorithms are depleted, meaning that they always return the answer,” Avigad says. Heule and his collaborators are using such techniques to deal with Collatz’s idea, which is just a problem.

“The interesting thing is the only way is that you can turn on the computer, I’m waiting.”

Jeffrey Lagarias

Heule specialist has a computational tool called the “SAT solver” – or “satisfiability” solver, a computer program that determines if there is a formula solution or a problem that is given to a problem. Although difficult, in mathematical crisis, a SAT tester is required for the problem to be interpreted, or represented, depending on the computer’s understanding. And as Yolcu, a PhD student and Heule put it, “Representing the masses is very important.”

Height, but effort

When Heule first mentioned Collatz’s deal with the SAT solution, Aaronson thought, “There’s no way to hell to work.” But he was easily convinced that it needed to be tested, as Heule saw hidden ways to change the old problem that would make it possible. He found that a team of computer scientists was using SAT solvers to better obtain convincing evidence that this was what they considered to be a “rewriting system.” It was a long one, but he told Aaronson that transforming Collatz’s ideas into a rewriting method would ensure the end of Collatz’s demise (Aaronson had already helped turn Riemann’s ideas into a reading machine, and typed them into Turing’s miniature machine). That evening, Aaronson made the plan. “It was like a home-based job, a gym,” he says.

Aaronson’s machine handled Collatz’s case with 11 rules. If investigators can find evidence against the same system, use these 11 rules in any way, which would prove Collatz’s assertion is true.

Heule experimented with modern technology to ensure the demise of the rewriting system, which did not work – it was frustrating if not surprising. “These tools are possible to solve problems that can be solved in minutes, while any solution to Collatz requires a few days,” says Heule. This provided an incentive to support their methods and use their tools to turn the rewriting problem into a SAT problem.

Aaronson thought it would be easier to tackle the system only on the 11th law – abandoning the “Collatz-like” system, an attempt at greater purpose. He presented a case against computers: The first to deal with all subsystems and the 10 rules of success. Aaronson tried by hand. Heule was tested with a SAT solver: He kept the system as a satisfactory problem – with another intelligent demonstration, interpreting the system into computer systems that can be 0s and 1s – and then allowing his SAT solver to work, looking for evidence to be affected.

MARINE HEULE

All of them managed to make sure the system ended with 10 different rules. Sometimes it was a small task, for the people and the program. Heule’s self-imposed procedure took 24 hours. Aaronson’s procedure required vigorous effort, taking a few hours or one day – one of the ten rules he could not prove, although he firmly believed it was, and a great deal of effort. Aaronson said: “To be honest, I was fighting the Terminator, not removing provermore.”

Yolcu has optimized the SAT solver, optimizing the tool to best meet Collatz’s problem. These tricks made all the difference – speeding up the shutdown of 10-Rule subsystems and reducing the running time to a few seconds.

“The big question that remains,” says Aaronson, “is,” What about the whole 11th team? You’re trying to run the system more efficiently and permanently, which should not surprise us, because it’s Collatz’s problem. “

As Heule sees it, most studies on such assumptions do not identify the complexities that require repeated calculations. But based on their past experiences, they believe that these problems will end. Others have seen it changed Collatz have rewrite the order, but it is a method of using a well-designed SAT solver with computational power that can attract evidence.

To date, Heule has conducted Collatz research using some 5,000 cores (computer-assisted switching machines; consumer computers have four or eight cores). Like Amazon Scholar, they explicitly invite him from Amazon Web Services to use “unlimited” – as many as a million. But they don’t want to spend too much time.

“I want proof that this experiment is possible,” he says. Otherwise, Heule realizes that he is just losing things and relying on them. “I don’t need 100% confidence, but I want to have proof that there is a chance for that to happen.”

Promoting change

“The beauty of this approach is that you can turn on the computer and wait,” says mathematician Jeffrey Lagarias, of the University of Michigan. He played with Collatz for almost 50 years and became the custodian of the information, writing ancient writings and writing a book on the subject, “High Problem.”In Lagarias, the self-imposed approach reminded me of a 2013 paper Princeton mathematician John Horton Conway, who also said that Collatz’s problem may be among the problems that are real and “unknown” – but at the same time unknown. As Conway put it: “… it could be that saying he can’t be criticized is not the only thing that can make him angry, and so on.”

“If Conway is right,” says Lagarias, “there will be no evidence, established or not, and we will never find an answer.”