A guest appearance by our faculty talks coordinator DeVon, we had an introduction to oracles. Additionally, he talked about Bounded Error Quantum Polynomial Time (BQP) vs. Polynomial Hierarchy (PH) and barriers to proofs in complexity theory. The slides are here.

Previous: Happy Ending Problem

This week, Sherry gave a lecture/problem session on the Happy Ending Problem, a popular field of mathematics created by P. Erdös, G. Szekeres, and E. Klein. This problem is very interesting for its connections to Ramsey theory. Her main reference is this website.

continue reading ❯