by Lizzy Maimone
During the Annual ACM Symposium on Theory of Computing from June 21–25, 2021, BU CS Professor Leonid A. Levin spoke about the topic “How to succeed in tasks like proving Fermat’s Theorem or predicting the Higgs boson.” To learn more about the event, click here.
This lecture aims at attracting attention to the following open problem: Can every algorithm finding, say, 3-coloring be sped up 10 times on an infinite set of graphs? Professor Levin speaks on this topic in-depth, using his personal findings and research capabilities to inform watchers. Watch it here: