University of Cambridge > Talks.cam > Accelerate Lunchtime Seminar Series > Numerically verified proofs in pure maths

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Numerically verified proofs in pure maths

Download to your calendar using vCal

If you have a question about this talk, please contact Sam Nallaperuma-Herzberg .

What’s a numerically verified proof? In pure maths we want to prove theorems, usually using pen and paper. On the other side there exist hundreds of very elaborate ways to approximately solve equations, for example physics-informed neural networks. Due to the advent of greater computational power it has recently become possible to use such approximate solutions in a theorem proofs. In the talk, I’ll explain how that works in a toy example and then briefly mention some applications of this in pure maths.

This talk is part of the Accelerate Lunchtime Seminar Series series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Large Meeting Room (groundfloor), Douglas House, 18B, Trumpington Road Lecture Theatre 2, Department of Computer Science & Technology, 15 JJ Thompson Avenue, Madingley Road, Cambridge, CB3 0FD 'Making All Things New'? Evangelii Gaudium and Ecumenical Mission

Other talks

Talk TBC Title to be confirmed Whether and when: Split-population cure models of women's work and parity progression in Derbyshire, 1881-1911 Dept of Zoology Inaugural lecture: 'Through the lens of a bee: from the past to the future' The Play Paradox: How video games build better humans Tea and Coffee Break
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity