Semi-Automatic Asymptotics in Isabelle/HOL
1 hour 24 mins,
1.18 GB,
MPEG-4 Video
640x360,
29.97 fps,
44100 Hz,
1.91 Mbits/sec
Share this media item:
Embed this media item:
Embed this media item:
About this item
| Description: |
Eberl, M
Wednesday 5th July 2017 - 13:30 to 14:30 |
|---|
| Created: | 2017-08-25 14:46 |
|---|---|
| Collection: | Big proof |
| Publisher: | Isaac Newton Institute |
| Copyright: | Eberl, M |
| Language: | eng (English) |
| Distribution: |
World
(downloadable)
|
| Explicit content: | No |
| Aspect Ratio: | 16:9 |
| Screencast: | No |
| Bumper: | UCS Default |
| Trailer: | UCS Default |
| Abstract: | Computer Algebra Systems can easily compute limits and asymptotic expansions of complicated real functions; interactive theorem provers, on the other hand, provide very little support for such problems and proving asymptotic properties of a function often involves long and tedious manual proofs. In this talk, I will present my work about bringing automation for real-valued asymptotics to Isabelle/HOL using multiseries expansions. This yields a procedure to automatically prove limits and ‘Big-O' estimates of real-valued functions similarly to computer algebra systems like Mathematica and Maple – but while proving every step of the process correct.
|
|---|---|
Available Formats
| Format | Quality | Bitrate | Size | |||
|---|---|---|---|---|---|---|
| MPEG-4 Video * | 640x360 | 1.91 Mbits/sec | 1.18 GB | View | Download | |
| WebM | 640x360 | 450.09 kbits/sec | 276.92 MB | View | Download | |
| iPod Video | 480x270 | 492.21 kbits/sec | 302.83 MB | View | Download | |
| MP3 | 44100 Hz | 251.1 kbits/sec | 154.49 MB | Listen | Download | |
| Auto | (Allows browser to choose a format it supports) | |||||