University of Cambridge > > Isaac Newton Institute Seminar Series > Big Conjectures

Big Conjectures

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact INI IT.

BPRW01 - Computer-aided mathematical proof

Proof assistants have been used to verify complicated proofs such as the Kepler conjecture in discrete geometry and the odd-order theorem in group theory. Can formalization technology help us to understand the statements of complicated conjectures such as Millennium (million-dollar) problems of the Clay Institute, the geometric Langlands conjecture, or the Kelvin problem for optimal partitions of space? 

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


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