1571852005
Boston Computation Club

Advertise on podcast: Boston Computation Club

This podcast has
89 episodes
Language
English
Explicit
No
Date created
2021/06/11
Latest episode
2026/09/08
Average duration
56 min.
Release period
30 days

Description

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.

Unlock Boston Computation Club podcast Email contact info,
Listeners & Audience details

Email contact information

Direct podcast contact details

Listeners

Audience numbers & engagement insights

Audience details

Podcast Insights

Podcast episodes

Check latest episodes from Boston Computation Club podcast


Sum-check protocol: categorical view, Alex Sorokin
2026/09/08
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!
P-stability for 3-uniform Hypergraphs, Daniel Yu
2026/09/08
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.
Understanding patterns of adoption and adaptation of open models on local systems, Woohyeuk (Kevin) Lee
2026/09/08
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.
Cellular automata and artificial life in the deep learning era, Casey Martin
2026/09/08
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!
06/26/26: Tracing Introspection Across Model Depth, Zach Maas
2026/07/03
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!
An Extremely Short Proof of the Hairy Ball Theorem with Peter McGrath
2026/04/18
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!
Logic.py: Bridging the Gap between LLMs and Constraint Solvers with Pascal Kesseli
2026/03/09
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.
2/17/26: Approximately Aligned Decoding with Daniel Melcer
2026/02/18
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.
02/06/26: Early experiments in FMxAI at Galois with Max von Hippel
2026/02/07
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.
VeriExploit: Automatic Bug Reproduction in Smart Contracts via LLMs and Formal Methods, Chenfeng Wei
2026/01/17
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!
Breaking the Sorting Barrier for Directed Single-Source Shortest Paths - Xiao Mao
2026/01/05
Today Xiao Mao joined us to discuss his groundbreaking work, Breaking the Sorting Barrier for Directed Single-Source Shortest Paths. It's not every day you beat Djikstra at something. This was a good one. Thank you for talking to us, Xiao!
Infecting Generative AI with Viruses - David A. Noever and Forrest McKee
2025/09/15
David A. Noever and Forrest McKee 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. 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!
08/15/25: An LLM Agent for Functional Bug Detection in Network Protocols with Mingwei Zheng
2025/08/15
Mingwei Zhenga Ph.D. candidate in the Department of Computer Science at Purdue University, advised by Prof. Xiangyu Zhang 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!
08/01/25: Formal Reasoning Meets LLMs: Toward AI for Mathematics and Verification with Kaiyu Yang
2025/08/02
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!
07/25/25: RefinedC: Automating the Foundational Verification of C Code with Refined Ownership Types with Michael Sammler
2025/07/25
Michael Sammler n assistant professor leading the Programming Languages and Verification Group at the Institute of Science and Technology Austria (ISTA). Today he joined us to talk about his three primary projects: RefinedC, which uses a refinement and ownership type system to verify C code, Islaris, which shows how to scale verification of assembly code to realistic models of real-world architectures, and 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!

Podcast reviews

Read Boston Computation Club podcast reviews


0 out of 5
0 reviews

Podcast sponsorship advertising

Start advertising on Boston Computation Club relevant audience podcasts


What do you want to promote?