Abstract
Man has grappled with the meaning and utility of randomness for millennia. Randomness is paramount to many fields of science, and probabilistic algorithms play a key role is solving important problems in many disciplines. Computational complexity theory offers new insights about the power and limit of randomness in such settings, and a concrete computational notion of pseudo-randomness.
Original language | English |
---|---|
Title of host publication | XVIIth International Congress on Mathematical Physics |
Subtitle of host publication | Aalborg, Denmark, 6-11 August 2012 |
Publisher | World Scientific Publishing Co. |
Pages | 254-266 |
Number of pages | 13 |
ISBN (Electronic) | 9789814449243 |
ISBN (Print) | 9789814449236 |
DOIs | |
State | Published - 1 Jan 2013 |
Externally published | Yes |
Bibliographical note
Publisher Copyright:© 2014 by World Scientific Publishing Co. Pte. Ltd. All rights reserved.