Randomness in Computations, A Sentimental Journey

Synopsis: Video recording of the New Fellows Seminar given at the Royal Society by Professor Michael Rabin on 10/7/2008. When dealing with computations intended to produce exact results, the injection of randomness into the process seems to be an absurd idea. And yet, over the past thirty years randomized algorithms have emerged as a powerful tool for the solution of many important computational problems. Examples include testing large integers for primality, finding a nearest pair within a set of points, unbreakable encryptions, and implementing secure auctions. (24 minutes)
Language: English
Country: Great Britain
Year of release: 2008
Year of production: 2008
Subjects: Information technology; Mathematics
Keywords: computer programming; mathematical programming; randomness

Name: Royal Society: Royalsociety.tv
Email: http://royalsociety.org/contact-us/?from=header
Web: http://royalsociety.org/ External site opens in new window
Phone: 020 7451 2500
Address: 6-9 Carlton House Terrace
London
SW1Y 5AG
Notes: Royalsociety.tv offers live webcasts as well as podcasts and free, on-demand streaming of video and audio recordings of events held at the Royal Society. Lectures and discussions feature leading scientists and cover history of science as well as exploring cutting-edge science and culture.

This record has been viewed 501 times.