University of Cambridge > Talks.cam > Formalisation of mathematics with interactive theorem provers  > Can a computer judge interestingness?

Can a computer judge interestingness?

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

If you have a question about this talk, please contact Anand Rao Tadipatri.

(NOTE UNUSUAL DAY/TIME)

Mathematics is made up of provable interesting statements about numbers, geometry and abstract structures. While proof can be precisely defined, interestingness remains mysterious, a matter of intuition. In this talk we discuss ways to implement interestingness on a computer, both in symbolic and formal terms, and using state of the art AI.

The slides from the talk can be found here: https://www.dropbox.com/scl/fi/9u9jq8ye9uvsd489rwxmn/douglas-cambridge-rev.pdf?rlkey=eup4bpurenb8j0eat68yqljsd&e=1&st=jkjeuo93&dl=0.

—-

WATCH ONLINE HERE : https://www.microsoft.com/en-gb/microsoft-teams/join-a-meeting?rtc=1 Meeting ID: 370 771 279 261 Passcode: iCo7a5

This talk is part of the Formalisation of mathematics with interactive theorem provers series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

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