Files in This Item:
| File | Format | ||
|---|---|---|---|
| b1119095.mp4 | Streaming Video | View/Open |
| Title: | Pseudo-randomness and Arithmetic Combinatorics |
| Originating Office: | OUDPA |
| Speaker: | Bourgain, Jean |
| Issue Date: | 29-Sep-2010 |
| Event Date: | 29-Sep-2010 |
| Group/Series/Folder: | Record Group 3.8 - Office of University Development and Public Affairs Series 6 - Audio-visual Materials |
| Location: | 3.8:6 box 6.3.4 |
| Notes: | The Shaw Prize Lecture in Mathematical Sciences 2010. Abstract: How to produce a process that looks like an unbiased coin flipping? This is clearly a question of multi-disciplinary importance. Without access to 'true randomness', relying on algebraic constructions is a common substitute. Even simple algebraic processes may offer indeed a great deal of complexity and are expected to display various randomness features.' In the lecture Prof Bourgain discusses some new developments in the underlying mathematics that explain some of these phenomena. Duration: 76 min. |
| Appears in Series: | 3.8:6 - Audio-visual Materials Videos for Public -- Distinguished Lectures |