Can a computer judge interestingness?

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

• Michael Douglas (Center of Mathematical Sciences and Applications, Harvard University)
• Monday 29 April 2024, 14:00-15:00
• MR15 Centre for Mathematical Sciences.

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.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Cambridge talks
• DPMMS Lists
• DPMMS Pure Maths study groups
• DPMMS info aggregator
• DPMMS lists
• Department of Computer Science and Technology talks and seminars
• Formalisation of mathematics with interactive theorem provers
• Hanchen DaDaDash
• Interested Talks
• MR15 Centre for Mathematical Sciences
• School of Physical Sciences
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31

Note that ex-directory lists are not shown.