Well-quasi-orderings for progam analysis and computational complextiy
60 mins,
110.21 MB,
MP3
44100 Hz,
250.78 kbits/sec
Share this media item:
Embed this media item:
Embed this media item:
About this item
| Description: |
Schnoebelen, P [CNRS (Centre national de la recherche scientifique)]
Wednesday 16th December 2015 - 10:00 to 11:00 |
|---|
| Created: | 2015-12-21 16:57 |
|---|---|
| Collection: | Mathematical, Foundational and Computational Aspects of the Higher Infinite |
| Publisher: | Isaac Newton Institute |
| Copyright: | Schnoebelen, P |
| Language: | eng (English) |
| Distribution: |
World
(downloadable)
|
| Explicit content: | No |
| Aspect Ratio: | 16:9 |
| Screencast: | No |
| Bumper: | UCS Default |
| Trailer: | UCS Default |
| Abstract: | Co-author: Sylvain Schmitz (ENS Cachan)
The talk will survey some of the applications of well-quasi-orderings in computer science. Well-quasi-orderings are an important tool in some areas like program verification, or computer-aided deduction and theorem-proving. Most importantly, they provide easy proofs for the decidability of logical or combinatorial problems. Recent work by the authors aim at extracting computational complexity bounds from decidability proofs that rely on well-quasi-orderings. |
|---|---|
Available Formats
| Format | Quality | Bitrate | Size | |||
|---|---|---|---|---|---|---|
| MPEG-4 Video | 640x360 | 1.94 Mbits/sec | 874.55 MB | View | Download | |
| WebM | 640x360 | 658.25 kbits/sec | 289.27 MB | View | Download | |
| iPod Video | 480x270 | 523.78 kbits/sec | 230.18 MB | View | Download | |
| MP3 * | 44100 Hz | 250.78 kbits/sec | 110.21 MB | Listen | Download | |
| Auto | (Allows browser to choose a format it supports) | |||||