Discover this podcast and so much more

Podcasts are free to enjoy without a subscription. We also offer ebooks, audiobooks, and so much more for just $11.99/month.

09/09/23: Transferable and Fixable Proofs with Bill Dalessandro

09/09/23: Transferable and Fixable Proofs with Bill Dalessandro

FromBoston Computation Club


09/09/23: Transferable and Fixable Proofs with Bill Dalessandro

FromBoston Computation Club

ratings:
Length:
65 minutes
Released:
Sep 9, 2023
Format:
Podcast episode

Description

Bill Dalessandro is a philosopher of science and mathematics at Oxford University. Today Bill joined us to discuss proofs -- specifically, what it means for a proof to be fixable, what it means for a proof to be transferable, and the apparent tension between these notions. This work built on prior work by Northeastern's Don Fallis, who attended the talk and participated in the lively and fascinating conversation that ensued. We also discussed what it's like to work in an interactive theorem prover. In such an environment, you don't really make mistakes -- because the prover doesn't let you -- but you might prove the wrong thing, and/or, you might not learn much despite having proven something. This was a great talk with a great with a really strong discussion section and we hope you enjoy it as much as we did!

- Bill's website

- The paper in question
Released:
Sep 9, 2023
Format:
Podcast episode

Titles in the series (53)

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.