
Boston Computation Club
Max von HippelAudio
- Format:
- Podcast
- New episodes:
- Irregular
- Typical length:
- about 55 minutes
- Latest episode:
About this show
The Boston Computation Club is a small seminar group focused on mathematical computer science, and computational mathematics. Its name is plagiarized from the London Computation Club. Boston Computation Club meetings occur roughly every other week, on weekends, around 5pm EDT (modulo speaker availability). The usual format is a 20m presentation followed by 40m of discussion. Some, but not all, meetings are posted on YouTube and in podcast form.
Covers: mathematics, computer science, artificial intelligence, AI safety, formal methods, large language models, pure mathematics, cellular automata
Show details and episodes come from the publisher's public feed at anchor.fm. Last updated . Names, artwork and text belong to their publishers.
Recently on this show
Summary of recent episodes, drawn from the publisher's feed.
This podcast records talks from a small seminar group on mathematical computer science and computational mathematics, followed by discussion. Recent episodes cover hardware vibe-coding, AI risk starting from percolation theory, the sum-check protocol, local open AI models, cellular automata, model introspection, and the Hairy Ball Theorem.
Cosmos
Similar in subject
- Wes Roth
Both cover: computer science, ai safety, large language models - Two Minute Papers
Both cover: computer science, large language models, mathematics - 3Blue1Brown
Both cover: computer science, large language models, mathematics
Similar shows
Explore more
Episodes
04/18/25: Descriptive Complexity with Ramit Das
· 1 hr 0 min
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!
Not rated yet03/21/24: How and Why to extend First Order Logic for Knowledge-Based Systems with Marc Denecker
· 52 min
Today Marc Denecker joined us to present How and Why to extend First Order Logic for Knowledge-Based Systems (https://www.idp-z3.be/). This presentation provided the setup for a follow-on that Marc's student Simon Vandevelde is set to give on IDP-Z3, a formal reasoning machine that Marc and Simon have built. This was a really interesting talk touching on a variety of forms for formal logic, decision procedures, and industrial use-cases thereof, potentially with profound implications for the future and realizability of so-called AGI.
Not rated yet04/04/25: Constrained Decoding for Code Language Models via Efficient Left and Right Quotienting of Context-Sensitive Grammars with Daniel Melcer
· 58 min
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!
Not rated yet03/08/25: An Introduction to LiquidHaskell with Michael H. Borkowski
· 1 hr 2 min
Michael H. Borkowski (https://michaelborkowski.github.io/) is an Assistant Professor of Practice in the Department of Computer Science at Purdue University. Before joining Purdue, he earned his Ph.D. from the Department of Computer Science and Engineering at UC San Diego, where he was affiliated with the ProgSys Group. Today Michael joined us to discuss LiquidHaskell, a very cool project that incorporates a kind of refinement types, with SMT-based proofs, into Haskell. This was a really compelling talk and we hope you enjoy it as much as we did!
Not rated yet01/10/25: Combining Causal Inference and Knowledge Graphs with Brook Santangelo and John Sterrett
· 58 min
Today Brook Santangelo (https://www.linkedin.com/in/brooksantangelo/) and John Sterrett (https://sterrettjd.github.io/)
Not rated yet01/04/25: Hacking GenAI with LLM Red Teaming and Beyond with Gaspard Baye
· 1 hr 0 min
Gaspard Baye (https://www.linkedin.com/in/bayegaspard/) is a Cyber AI Ph.D. Candidate at the University of Massachusetts Dartmouth (https://www.linkedin.com/company/15250322/), where he researches AI-driven offensive and defensive security applications. Today Gaspard joined us to present "Hacking GenAI with LLM Red Teaming and Beyond" based on his recent DefCon talk. This was a really fun event with a great Q&A. Thanks to Jacob from the Trust Lab (https://sites.dartmouth.edu/trustlab/) for hosting!
Not rated yet11/30/24: LB4TL: A Smooth Semantics for Temporal Logic to Train Neural Feedback Controllers with Navid Hashemi
· 45 min
Navid Hashemi recently defended his PhD at USC and is about to begin a post-doc at Vanderbilt. His research focuses on the intersection of Artificial Intelligence and Temporal Logics, with applications in Formal Verification of Learning Enabled Systems and Neurosymbolic Reinforcement Learning. Today Navid joined us for a really exciting presentation about his work on metrizable logics for reinforcement learning, and a technique for verification thereof based on the over-approximation of reachable sets using ReLU.
Not rated yet11/17/24: When Static Analysis Meets Large Language Models with Chengpeng Wang
· 57 min
Chengpeng Wang (https://chengpeng-wang.github.io/) working with Prof. Xiangyu Zhang (https://www.cs.purdue.edu/homes/xyzhang/). His research focuses on program analysis, especially software analysis, and in particular how existing analysis techniques intersect with emerging approaches from AI such as Large Language Models. Today Chengpeng joined us to talk about his recent NeurIPS paper proposing a novel static analysis technique based on LLMs. The technique is very interesting and highly informed by prior works in the static analysis space, but leverages LLMs as a kind of "oracle" to solve problems which, when handled statically, quickly become untenable. This was a really interesting talk and we're very greatful that Chengpeng took time out of his Sunday afternoon to talk to us!
Not rated yet10/05/24: Abuse-Resistant Location Tracking: Balancing Privacy and Safety in the Offline Finding Ecosystem with Harry Eldridge
· 50 min
Harry Eldridge (https://harryeldridge.com/) is a Cryptography PhD student at Johns Hopkins, advised by Abhishek Jain (https://www.cs.jhu.edu/~abhishek/) and Matthew Green (https://isi.jhu.edu/~mgreen/). His research (so far) touches on security and privacy implications of commodity hardware, which is a fascinating topic deserving of the mathematically disciplined, cryptographically informed approach his lab takes to such problems. Today Harry joined us to talk about his research into the problem of AirTag stalking, and how it can be ameliorated, while retaining acceptable performance, through cryptographic protocols. This was a very interesting talk with serious, real-world implications, and we hope you enjoy it as much as we did!
Not rated yet09/28/24: Hacking an LLM Using the Z3 Theorem Prover with Ian Bicking
· 54 min
Ian Bicking (https://ianbicking.org/) is an engineer at Brilliant, which is also what he is. (Sorry, dad joke). Ian joined us today to talk about his super charming (and extremely interesting) weekend of experiments hacking various LLMs to solve puzzles using z3. The presentation was roughly the first 2/3 of the event and the remaining third presented a fantastic conversation about the future of AI, tool use, chain and tree of thought, o1, and more. Thanks again for joining us Ian!
Not rated yet09/07/24: Shaken, not Stirred -- Automated Discovery of Subtle Attacks on Protocols using Mix-Nets with Dhekra Mahmoud
· 57 min
Dhekra Mahmoud (https://perso.isima.fr/~dhmahmoud/index.html) at LIMOS (https://limos.fr/) in Clermont-Ferrand, France, where she researches the formal analysis of cryptographic protocols under the supervision of Pascal Lafoucade (https://sancy.iut.uca.fr/~lafourcade/) and Jannik Dreier (https://members.loria.fr/JDreier/). Today Dhekra joined us to present her recent USENIX paper Shaken, not Stirred -- Automated Discovery of Subtle Attacks on Protocols using Mix-Nets. (https://hal.univ-grenoble-alpes.fr/LORIA-FM/hal-04615474v1) This was a really interesting presentation with a good conversation afterword touching on some subtler points around the Dolev-Yao threat model, the limitations of ProVerif, and proof optimization.
Not rated yet08/25/24: An Introduction to Lurk with Matej Panciak
· 1 hr 1 min
Matej Panciak (https://mpenciak.github.io/) holds a PhD in mathematics and is a software engineer at the Argument Computer Corporation (https://github.com/argumentcomputer), where among other things, he works on Lurk (https://github.com/argumentcomputer/lurk-rs). Lurk is a LISP for defining computations that can prove (in the ZKP sense) that they ran, which is probably useful for all sorts of cool things we haven't thought of yet, but right now, is pretty important for doing stuff on-chain. (I can easily imagine this being applicable to building something like a dweb version of AWS ... in some theoretical future where FHE is so good that you can just trust randos to run code for you). Anyway, Matej presented a super rad intro to Lurk, gave us a code demo (it worked!) and then enjoyed our usual über-nerd conversational segment at the end.
Not rated yet08/17/24: Efficient Synthesis of Symbolic Distributed Protocols by Sketching with Derek Egolf
· 52 min
Derek Egolf (https://www.egolf.io/) is a PhD student (since 2021) at Northeastern University, advised by Stavros Tripakis. His primary research focus is the automatic generation of correct-by-construction systems from high-level specifications (synthesis). Today Derek talked about his recent paper in this vein, Efficient Synthesis of Symbolic Distributed Protocols by Sketching (https://arxiv.org/pdf/2405.07807), to appear in FMCAD. This was a very interesting talk with a technical conversation afterword. We hope you enjoy it as much as we did!
Not rated yet08/10/24: Radically Better Academic Search With Undermind with Joshua Ramette
· 57 min
Joshua Ramette (https://x.com/RametteJoshua) recently completed a PhD in physics at Mass Tech, and today he joined us to talk about his new project, Undermind. Josh and his friend Tom Hartke (https://www.tomhartke.com/) founded Undermind (YC S24) to radically improve academic literature search using a mixture of AI techniques. Their system is slow, deliberate, and very high quality. You can check out Undermind at www.undermind.ai , or peruse the query I did during the Q&A section here: https://www.undermind.ai/query_app/display_one_search/c743b66ee4378b12ae8bad1fe58975ba95da71e7f7a1d5c2f0c6973c677648cc/
Not rated yet07/27/24: Pragmatic Program Synthesis with Evan Pu
· 1 hr 16 min
Evan Pu ( https://evanthebouncy.github.io/ , @evanthebouncy on X ) is a senior research scientist at Autodesk AI Lab, working on code-generation for human-machine collaboration in CAD, and industry scale instruction-following dataset annotation. Today Evan joined us from a toilet (with the lid closed) so as not to wake up his wife due to a rather large time-zone delta, which was hilarious and a first for the Boston Computation Club. Anyway, this was a really fun talk with excellent Q&A and we hope you enjoy it as much as we did!
Not rated yet07/06/24: The Algebraic Structure of Infinite Craft with Arthur O’Dwyer
· 53 min
Arthur O’Dwyer is a C++ programmer and blogger who today joined us to talk about his musings on the algebraic structure of the popular web-game Infinite Craft. Infinite Craft is a clever little experiment in sandboxed exploration, and it turns out to give rise to a rather complex mathematical structure with some interesting background in theoretical CS. Arthur covered all this and more in his presentation, which was super interesting and a lot of fun to watch. Check out Arthur's original blog post here: https://quuxplusone.github.io/blog/2024/03/03/infinite-craft-theory/ Check out Arthur's slides here: https://bstn.cc/artifacts/arthurODwyer/infiniteCraft.pdf
Not rated yet06/22/24: npm install everything with Evan Boehs
· 40 min
Evan Boehs is a HIGH SCHOOL STUDENT who broke the freaking internet. What more do I need to say? Hire this kid. Maybe I will. It's a race. Evan made an npm package called everything which installs everything. Then he got stuck in a dependency loop when someone tried to delete something. It turns out this is a nearly impossible problem to solve and he totally broke npm. Then a bunch of adults got made at him, when really, they should have been mad at themselves for building a bad system. You can read Evan's full story here: https://boehs.org/node/npm-everything
Not rated yet06/08/24: Compressing a JSON Parser Beyond Comprehension with June Marcuse
· 53 min
June Marcuse (https://github.com/boxbeam)
Not rated yet04/20/24: Chess-GPT's Internal World Model with Adam Karvonen
· 58 min
Adam Karvonen was my coworker at Galois and is a bright guy doing really interesting stuff in the ML interpretability space. Today he joined us to present his work on Chess-GPT, you guessed it, a GPT model that can play chess. The punchline isn't so much how good the model is as it is how the model "thinks" -- Adam provides compelling evidence that the model internally reasons about an actual board state, and learns to make legal moves. The discussion on this one was great and we really appreciate that Adam took the time to talk to us! Also -- you should hire him! He's doing MATS but will be on the job market at the end of the Summer.
Not rated yet04/12/24: DY Fuzzing: Formal Dolev-Yao Models Meet Cryptographic Protocol Fuzz Testing with Max Ammann
· 59 min
Max Ammann is a cybersecurity researcher at Trail of Bits, where he's recently been working on extending his Master's thesis work on fuzzing cryptographic protocols into an industrial-grade fuzzing tool. That work resulted in an S&P publication which is what he joined us to present today. This was a really good talk but also a great discussion, in large part because of the highly engaged audience (with representation from Galois, TwoSix, and academia!).
Not rated yet