How do human mathematicians avoid big searches?
1 hour 32 mins,
355.18 MB,
iPod Video
480x270,
29.97 fps,
44100 Hz,
527.1 kbits/sec
Share this media item:
Embed this media item:
Embed this media item:
About this item
| Description: |
Gowers, W
Friday 28th July 2017 - 13:30 to 14:30 |
|---|
| Created: | 2017-07-28 16:06 |
|---|---|
| Collection: | Big proof |
| Publisher: | Isaac Newton Institute |
| Copyright: | Gowers, W |
| Language: | eng (English) |
| Distribution: |
World
(downloadable)
|
| Explicit content: | No |
| Aspect Ratio: | 16:9 |
| Screencast: | No |
| Bumper: | UCS Default |
| Trailer: | UCS Default |
| 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. |
|---|---|
Available Formats
| Format | Quality | Bitrate | Size | |||
|---|---|---|---|---|---|---|
| MPEG-4 Video | 640x360 | 1.96 Mbits/sec | 1.32 GB | View | Download | |
| WebM | 640x360 | 1.0 Mbits/sec | 691.50 MB | View | Download | |
| iPod Video * | 480x270 | 527.1 kbits/sec | 355.18 MB | View | Download | |
| MP3 | 44100 Hz | 249.73 kbits/sec | 170.11 MB | Listen | Download | |
| Auto | (Allows browser to choose a format it supports) | |||||