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

  Browse A-Z

Log in

Cambridge users (raven)details Other usersdetails No account?details

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

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.

Other lists

Michael Perkins Lecture Philosophy and History of Science Wellcome Lecture in the History of Medicine Society To Science SPS Society Turkish-Armenian Relations. Facing History: Denial as a Security Concept

Other talks

The Ambonese Rumphius and his inter-island information networks Rethinking African Studies: The Wisdom of the Elders Accelerating the control of bovine Tuberculosis in developing countries Interconversion of Light and Electricity in Molecular Semiconductors 'Alas, poor Yorick!': Laurence Sterne's "A Sentimental Journey" after 250 years' Inelastic neutron scattering and µSR investigations of an anisotropic hybridization gap in the Kondo insulators: CeT2Al10 (T=Fe, Ru and Os)
 

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