The morning lecture featured Dr. Dana Moshkovitz (MIT). Her talk explained the basics of theoretical computer science: what are P and NP, why understanding them is important, and the limitations of approximation algorithms for NP-hard problems.
DS (directed study) block 2 had its last day today (see schedules on archives page)! DS’s included Combinatorial Games, Cybersecurity, and the Mathematics of Genetics.
Dr. Scott Aronson (MIT) gave the evening lecture. He talked about computational complexity, discussing what can and can’t be computed. Along with a crash course of quantum mechanics, he touched on models of computation that might go beyond quantum computers.
Delegates and staph are heading out on overnight trips again; next update will be on June 27, 2016!