Why Computer Scientists Need Magic 8 Ball-Like Oracles

Original version Of This is the story Present How many magazinesThe

Break a question to a magic 8 ball and it will answer yes, no, or annoyingly something involuntary. We think of it as a kid’s toy, but theoretical computer scientists use a similar tool. They often imagine that they can consult a hypothetical device called Oracles that can answer immediately and correctly specific questions. These fabulous thought tests have inspired the new algorithm and helped researchers’ count on the landscape map.

Researchers who call Oracles work in a subfield in computer science, known as the Computational Complexity Theory. They are concerned with the underlying difficulty of having a number of a number or the shortest way between two points on a network. Some problems are easy to solve, others seem to be stronger but there are solutions that are easy to test, easy for others Quantum computer However, it is seemingly difficult for the general public.

Complexity theorists want to understand whether these apparent differences of disadvantages are basic. What is intrinsic about some problems is tough, or are we not cunning enough to come up with a good solution? Researchers addressed these questions by picking up problems ”Complexity class“-All of the simple problems go into one class, for example, and easily all the problems of the check moves to the other-and proves the theorem about the relationship between that class.

Unfortunately, mapping the disadvantage of calculation has become good, difficult. So in the middle of the 1970s, some researchers began to study what would happen if the rules were different. That’s where the Oracles come.

Like Magic 8 balls, Oracles are devices that answer yes or a question immediately without expressing anything about their internal work. Unlike Magic 8 balls, they always say yes or no and they are always correct – the advantage of being imaginary. Furthermore, any given Oracle will only answer a particular kind of question, such as “Is this number the main?”

What makes these imaginary devices useful for real world understanding? In short, they can reveal hidden connections in the class of various complications.

Take two famous complexity classes. There are classes of problems that are easy to solve, which researchers say “P” and the problems that are easy to test, which researchers call “NP”. Is it easy to solve all the simple problems of all checks? If that is the meaning of it will be equal to NPP and all encryption will be Is easy to crack (Between other consequences). The complication theorists suspect that NPP does not equal, but they cannot prove it, though they are trying to pin the relationship between two classes More than 50 yearsThe

Oracles helped them understand better what they were doing with them. Researchers have discovered Oracles that answer questions that help solve many different problems. In a world where there was a hotline of an oracle in each computer, all easily Czech-Chec problems will be easy to solve and the PNP will be equal. However, the other, the less aided oracles have the opposite effect. In a world that is populated by these oracles, P and NPs will probably be different.