Boston Computation Club

Today Peter McGrathAn Extremely Short Proof of the Hairy Ball Theorem. Peter is a professor of mathematics at NC State, where he researches geometric analysis, minimal surfaces, PDEs. Today's talk was an elegant presentation of the classical result -- Peter makes it accessible, and explains each concept in a clear and transparent manner. This was a really fun talk and really back to our roots as a group, doing pure math on an iPad and loving it! We hope you enjoy the talk as much as we did!

Max von Hippel is ... me, the organizer and founder of the Boston Computation Club. Today I hosted an extremely informal event to chat about some of the early experiments in FMxAI I was involved with at Galois, two years ago.

Dimitri Mitropoulos is a Michigan-based typescript dev, linguist, and classicist who joined us to talk about his completely unhinged, odyssean, and frankly just unwise project to get DOOM running completely within Typescript's type system. Someone give the dude a PhD, please.

Ramit Das is a formal verification engineer at Intel and an avid Boston Computation Club group member. Ramit and I have been speaking for ages about formal methods, exchanging papers, etc. and today he finally agreed to come give a talk to the group about his area of expertise -- descriptive complexity. This was a really fun talk and an excellent introduction for anyone looking to get their feet wet with complexity theory, some language theory, and even a smidgeon of model theory and underpinnings of abstract interpretation. It was really fun and we can't wait to host another talk by Ramit sometime in the future!

Today Daniel Melcer joined us to present Constrained Decoding for Code Language Models via Efficient Left and Right Quotienting of Context-Sensitive Grammars (https://arxiv.org/pdf/2402.17988). This is work he completed while at Amazon, and it's a really interesting project around how to constrain, guide, and check language models such that they generate valid code within a given context. We really appreciate that Daniel took the time to talk to us and hope you like the talk as much as we did!

Roger Waleffe is a PhD student in Computer Science at the University of Wisconsin-Madison working under the supervision of Prof. Theodoros (Theo) Rekatsinas (now at ETH Zurich). A few months ago one of our group members (Brennon) saw Rover's talk at EuroSys and thought it was pretty rad, so we invited Roger to give the same talk to the Club today. (You can decide, what's more prestigious, EuroSys or 6 random dudes from Boston?). Roger graciously agreed and gave a superb talk on MariusGNN, his recent work to make a blazingly fast, super resource efficient system for graph neural networks. We hope you enjoy the talk as much as we did!

Christopher Ba Thi Nguyen is a professor of philosophy at the University of Utah, and the author of Games: Agency as Art. Today he joined us to discuss his book, which covers the philosophy of all sorts of games: rock climbing, Dark Souls, judo, poker, dungeons and dragons, etc. The event took the form of an interview hosted by Wei Sun, a longtime group member who read Thi's book in detail and really vibed with it. This was one of the most engaged and dynamic conversations we've hosted and in contrast to other events which have had a heavily visual component, this one is mostly auditory, so should make a very good podcast-style experience. We're very grateful to Thi for joining us today and to Wei for hosting the event, and we hope you enjoy it post-hoc as much as we did live! - The book: https://www.amazon.com/Games-Agency-As-Art-Thinking/dp/0190052082- Wei's blog: http://weiright.blogspot.com/2022/06/movie-review-everything-everywhere-all.html - Wei's blog: http://weiright.blogspot.com/2022/06/movie-review-everything-everywhere-all.html

John Viega is the Executive Vice President of Products, Strategy, & Engineering at SilverSky, an Adjunct Professor at NYU Poly, former editor-in-chief for IEEE Security and Privacy Magazine, co-developer of GCM (a mode of operation for block ciphers such as AES), and the original author of Mailman, the GNU Mailing List Manager.  He's also the founder of CrashOverride, a stealthy new security company which you should totally apply to work at!  Today he joined us to do an impromptu Q&A about his storied career as one of the people on the ground floor of cybersecurity, in its messy and exciting start.  This was a fun one and we hope you enjoy it as much as we did!

LakYah Tyner is a 1st year PhD student at Northeastern University co-advised by abhi Shelat and Daniel Wichs.  Her research focuses on cryptography, with recent works involving Property Preserving Hashing and Threshold Signature Schemes.  Put differently, she's accomplished considerably more in less than a year of graduate school than I did as a first year (we're a semester in and she has a paper in Crypto!), and today she joined the Boston Computation Club to share some of that hard-earned wisdom.  LakYah's talk focused on the difficult problem of efficiently hashing data such that the hashes preserve a binary predicate relationship from the pre-image, specifically a relationship relating to the distance between the two compared objects.  This is a fascinating topic with implications for systems like Apple's facial recognition and attempts at privacy-preserving CSAM detection.  We're super stoked LakYah agreed to speak to us today and we hope you enjoy her talk as much as we did!  LakYah's website: https://www.khoury.northeastern.edu/home/lakyahtyner/index.html  The paper: https://eprint.iacr.org/2022/842