Solving the Hardest Problems in Mathematics - Interview with Daniel Spielman

Explore the career and insights of Professor Daniel Spielman, winner of the 2010 Nevanlinna Prize, in this 30-minute interview conducted by University of Oxford Mathematician Dr Tom Crawford. Delve into Spielman's contributions to Mathematical Aspects of Information Sciences, including his work on smoothed analysis of Linear Programming, algorithms for graph-based codes, and applications of graph theory to Numerical Computing. Discover the significance of the Nevanlinna Prize (now renamed the Abacus Medal) and gain insights into Discrepancy Theory through a linked Maple Learn worksheet. Learn about Spielman's experiences, his perspective on solving challenging mathematical problems, and the impact of his research. Access additional resources, including links to related interviews with other mathematics and computer science laureates, Spielman's talks at the 2023 Heidelberg Laureate Forum, and relevant publications mentioned in the video.

Solving the Hardest Problems with Daniel Spielman (Nevanlinna Prize 2010)