
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.
Show details and episodes come from the publisher's public feed at anchor.fm. Last updated . Names, artwork and text belong to their publishers.
Cosmos
Similar by topic and creator
- BiotechTV - News
Shares the topic Science. - All Creatures Podcast
Shares the topic Science. - Pleasure People
Shares the topic Science.
Similar shows
Explore more
Episodes
Experiments with vibecoding hardware, Lewis Coriolan
· 41 min
Lewis Coriolan is a hacker, inventor, and entrepreneur, with wide-ranging interests. Today he joined us to talk about his experimentation vibe-coding hardware. This was a really cool talk and a glimpse at what's possible now with frontier models in hard-tech. It was also an important geopolitical conversation, as these developments severely lower the technological advantage that developed nations have over smaller countries or less well organized adversaries.
Not rated yetFrom percolation theory to recursive self-improvement and AI risk, Olle Häggström
· 55 min
Olle Häggström is a pure mathematician. Today, he joined us to tell the story of how his entire field of mathematics was essentially conquered by large language models in a short period of time, and to discuss the lessons about AI safety that he drew from this experience. This was a challenging and interesting conversation and, I think, a really compelling listen if you are not yet convinced of the imminency of AGI (or ASI).
Not rated yetSum-check protocol: categorical view, Alex Sorokin
· 46 min
Alex is a friend of mine and a mathematician. He did his PhD in mathematics with other Alex (Martsinkovsky), who has presented at the seminar group previously. We're huge fans of both Alexes at the Boston Computation Club and we hope you enjoy this talk as much as we did!
Not rated yetP-stability for 3-uniform Hypergraphs, Daniel Yu
· 1 hr 4 min
Today Daniel Yu gave a pure math talk on an extension he performed independently of work he had conducted during his math semester abroad in Budapest.
Not rated yetUnderstanding patterns of adoption and adaptation of open models on local systems, Woohyeuk (Kevin) Lee
· 35 min
Today Woohyeuk (Kevin) Lee joined us to discuss local AI (and the question of just how local it really is). This is exciting work at the intersection of computer science and social science! Enjoy.
Not rated yetCellular automata and artificial life in the deep learning era, Casey Martin
· 1 hr 9 min
Casey Martin is a dirtbag intellectual, local savant, and recent PhD in the Boulder metro area. He's a party favorite and today he joined us to discuss cellular automata and their generalizations. Enjoy!
Not rated yet06/26/26: Tracing Introspection Across Model Depth, Zach Maas
· 48 min
Zach Maas is an independent AI safety & mechanistic interpretability researcher in Boulder, Colorado, funded by Coefficient Giving. Today Zach joined us to talk about some of his recent work tracing introspection across model depth. This is, I think, the first mech interp talk we've hosted other than ChessGPT, and it was a good one! We hope you enjoy it as much as we did!
Not rated yetAn Extremely Short Proof of the Hairy Ball Theorem with Peter McGrath
· 58 min
Today Peter McGrath (https://math.sciences.ncsu.edu/people/pjmcgrat/) An Extremely Short Proof of the Hairy Ball Theorem (https://www2.math.upenn.edu/~pjmcgrat/research/hairy-ball.pdf). 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!
Not rated yetLogic.py: Bridging the Gap between LLMs and Constraint Solvers with Pascal Kesseli
· 57 min
Pascal Kesseli is a software engineer and technical lead at Microsoft AI, with a PhD in Computer Science from Oxford (or a DPhil? Or whatever they call PhDs on that side of the pond). Today Pascal joined us to discuss work he completed while at META FAIR, focused on the conjoining of large language models with symbolic reasoning systems (ultimately, dispatch to SAT) as well as future research directions building on said work.
Not rated yet2/17/26: Approximately Aligned Decoding with Daniel Melcer
· 48 min
Daniel Melcer is a PhD student at Northeastern University, where he researches formal methods, reinforcement learning, and large language models, among other things. Daniel also has the most colorful hair in the business (bright red for this talk, other colors for other occasions). Today he joined us to talk about some really exciting work he completed at Amazon, and to expand on his general vision of where constrained inference problems are heading in the future.
Not rated yet02/06/26: Early experiments in FMxAI at Galois with Max von Hippel
· 54 min
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.
Not rated yetVeriExploit: Automatic Bug Reproduction in Smart Contracts via LLMs and Formal Methods, Chenfeng Wei
· 41 min
Chenfeng Wei (https://research.manchester.ac.uk/en/persons/chenfeng-wei/) is a PhD student at the University of Manchester, where he researches formal guarantees for large language models. Today he joined us to talk about his latest work exploring bugs in smart-contracts. This is a really interesting project at the intersection of explainable AI, smart contract debugging/security, and cybersecurity/symbolic analysis, and I hope you enjoy it as much as we did!
Not rated yetBreaking the Sorting Barrier for Directed Single-Source Shortest Paths - Xiao Mao
· 57 min
Today Xiao Mao (https://matthew99a.github.io/) joined us to discuss his groundbreaking work, Breaking the Sorting Barrier for Directed Single-Source Shortest Paths (https://arxiv.org/abs/2504.17033). It's not every day you beat Djikstra at something. This was a good one. Thank you for talking to us, Xiao!
Not rated yetInfecting Generative AI with Viruses - David A. Noever and Forrest McKee
· 59 min
David A. Noever (https://www.linkedin.com/in/david-noever-98852a2a2/) and Forrest McKee (https://www.linkedin.com/in/forrest-mckee-50114a149/) are researchers at PeopleTec, where they work on problems at the intersection of security, defense, and AI/ML. Today David joined us to present their joint work Infecting Generative AI with Viruses. (https://arxiv.org/pdf/2501.05542) This was a really great presentation that took a rigorous approach to defining the security boundaries and limitations of AI tools, and it fostered one of the better discussions we've hosted in a while. We hope you enjoy it as much as we did!
Not rated yet08/15/25: An LLM Agent for Functional Bug Detection in Network Protocols with Mingwei Zheng
· 57 min
Mingwei Zheng (https://zmw12306.github.io/) a Ph.D. candidate in the Department of Computer Science (https://www.cs.purdue.edu/) at Purdue University (https://www.purdue.edu/), advised by Prof. Xiangyu Zhang (https://www.cs.purdue.edu/homes/xyzhang/) since 2021. Before that, she received her Bachelor’s degree in Computer Science and Technology from Huazhong University of Science and Technology in 2020. Mingwei's research lies at the intersection of Large Language Models (LLMs) and Software Engineering. She builds LLM agents that combine program analysis with LLMs for deep codebase understanding that improve software correctness, robustness, and trustworthiness. Today Mingwei joined us to discuss some ongoing work which she previously presented at IEEE Security and Privacy LangSec, applying language models to bug detection in protocols with IETF RFCs. This was a great talk with deep, technical content and a good conversation. We hope you enjoy!
Not rated yet08/01/25: Formal Reasoning Meets LLMs: Toward AI for Mathematics and Verification with Kaiyu Yang
· 1 hr 13 min
Today Kaiyu Yang from Meta joined us to discuss formal reasoning using LLMs, particularly in the context of interactive theorem provers. This is a really fast-moving and exciting field in which reinforcement learning and theorem proving combine to provide a new frontier for fully automated reasoning, and Kaiyu is at the bleeding edge of it. We were really lucky to get an hour of Kaiyu's time and we hope you enjoy the talk as much as we did!
Not rated yet07/25/25: RefinedC: Automating the Foundational Verification of C Code with Refined Ownership Types with Michael Sammler
· 52 min
Michael Sammler (https://pub.ista.ac.at/~msammler/) n assistant professor leading the Programming Languages and Verification Group (https://ista.ac.at/en/research/sammler-group/) at the Institute of Science and Technology Austria (ISTA) (https://ista.ac.at/). Today he joined us to talk about his three primary projects: RefinedC (https://plv.mpi-sws.org/refinedc/), which uses a refinement and ownership type system to verify C code, Islaris (https://github.com/rems-project/islaris), which shows how to scale verification of assembly code to realistic models of real-world architectures, and DimSum (https://plv.mpi-sws.org/dimsum/), which provides a decentralized approach for reasoning about multi-language programs (with a particular focus on RefinedC). We had a small but really dedicated crowd which facilitated an excellent discussion. This was a really fun one and we hope you enjoy it as much as we did!
Not rated yet06/20/25: TypeScript Types Can Run DOOM with Dimitri Mitropoulos
· 1 hr 41 min
Dimitri Mitropoulos (https://github.com/dimitropoulos) 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.
Not rated yet06/13/25: Gradual Verification with Jenna DiVincenzo
· 59 min
Jenna DiVincenzo (https://jennalwise.github.io/) is an Assistant Professor in the Elmore Family School of Electrical and Computer Engineering @ Purdue University. She is broadly interested in research spanning software verification, programming languages, and software engineering, especially research aimed at making verification techniques and programming languages more usable and scalable. Today Jenna joined us to talk about her broad research program in gradual verification. This was a really interesting talk with great Q&A and we hope you enjoy it as much as we did!
Not rated yet05/07/25: Exploring Zero-Shot Prompting for Generating Data Format Descriptions, Prashant Anantharaman
· 39 min
Prashant Anantharaman is a long-time BCC group member and has presented as both a solo researcher and a panelist to prior events. Today he joined us to present some of his work with NARF, to appear at IEEE S&P, on generating grammars for fuzzing using LLMs. This is a super exciting new frontier for LLMs and LangSec generally and his talk was wonderful.
Not rated yet