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

EPISODE · Sep 9, 2023 · 1H 5M

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

from Boston Computation Club · host Max von Hippel

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

Episode metadata supplied by the publisher feed · Published Sep 9, 2023

Embed this episode

NOW PLAYING

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

0:00 1:05:25

No transcript for this episode yet

We transcribe on demand. Request one and we'll notify you when it's ready — usually under 10 minutes.

No similar episodes found.

No similar podcasts found.

Frequently Asked Questions

How long is this episode of Boston Computation Club?

This episode is 1 hour and 5 minutes long.

When was this Boston Computation Club episode published?

This episode was published on September 9, 2023.

Can I download this Boston Computation Club episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.
URL copied to clipboard!