Tag Archives: directed study

End of Directed Studies #2

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.

Dr. Dana Moshkovitz: "The Possibilities and Limitations of Computation and Approximation"

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.

Jonathan Powels (IL) in Directed Study: Failure Analysis

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.

Dr. Scott Aaronson: “Quantum Computing and the Limits of the Efficiently Computable”

Delegates and staph are heading out on overnight trips again; next update will be on June 27, 2016!