A Problems Problem
Some math problems are easy to solve. Others seem hard, but their solutions are easy to check. Computer scientists want to know if the first class, called P, is truly different from the second, called NP. Siobhan Roberts explains the problem for MIT Technology Review. "P v NP" is the biggest unsolved problem in computer science. In May, Mordechai Rorvig wrote for Quanta about progress made on a related problem: A subset of the complexity class VNP was shown to be too hard to solve efficiently.
Galactic Neutrino Factory
Astronomers detected a stream of high-energy neutrinos blasting from the core of the nearby galaxy M77, reports Stephanie Pappas for Live Science. The news adds to a growing body of evidence that active galactic cores are common factories for high-energy neutrinos. In 2018 Katia Moskvitch wrote for Quanta about the discovery of the first such source. | |
