University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > How do human mathematicians avoid big searches?

  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

How do human mathematicians avoid big searches?

Download to your calendar using vCal

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

BPR - Big proof

I shall try to explain why I believe that computers will probably surpass humans at finding proofs within a small number of decades. The main content of the talk will be a close analysis of a few example problems of varying difficulty for humans, focusing on what humans do in order to reduce the size of the search space. Thus, it will be in the spirit of Polya, but with the ultimate goal of educating computers rather than humans.



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

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Webinar registration: https://us02web.zoom.us/webinar/register/WN_cc5p_rOVQoeZP1eSW24OFQ Faculty of Education, Mary Allan Building,Boulind 8 & 9, Homerton College, Hills Road, Cambridge CB2 8PQ Registration via https://www3.mrc-lmb.cam.ac.uk/sites/klug/

Other talks

From Physics-informed Neural Networks to Numerically Verified Proofs in Geometric Analysis A novel hereditary encephalopathy in four related Labrador Retrievers associated with a missense variant in the ALDH5A1 gene’ Welcome Reception and Poster Session An AI-Assisted Proof in Spectral Geometry Morning Break Title to be confirmed
 

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