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

How do human mathematicians avoid big searches?

Add to your list(s) 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.

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