skip to content
 

How do human mathematicians avoid big searches?

Presented by: 
William Timothy Gowers University of Cambridge
Date: 
Friday 28th July 2017 - 13:30 to 14:30
Venue: 
INI Seminar Room 1
Abstract: 
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.



The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons