Boston Computation Club

Boston Computation Club

By Max von HippelScienceMathematics
Download on the App Store

Boston Computation Club episodes

  • Sum-check protocol: categorical view, Alex Sorokin

    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!

    47 min
  • 06/26/26: Tracing Introspection Across Model Depth, Zach Maas

    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!

    49 min
  • An Extremely Short Proof of the Hairy Ball Theorem with Peter McGrath

    Today Peter McGrath
    An 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!

    59 min
  • Logic.py: Bridging the Gap between LLMs and Constraint Solvers with Pascal Kesseli

    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.

    58 min
  • 2/17/26: Approximately Aligned Decoding with Daniel Melcer

    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.

    49 min
  • VeriExploit: Automatic Bug Reproduction in Smart Contracts via LLMs and Formal Methods, Chenfeng Wei

    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!

    42 min

About Boston Computation Club

From the publisher's feed

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…

More shows like Boston Computation Club

The Ezra Klein Show by New York Times Opinion

The Ezra Klein Show

15,882 Listeners